Recursion - The Walls of the Computable

Failed to add items

Sorry, we are unable to add the item because your shopping cart is already at capacity.

Add to basket failed.

Please try again later

Add to wishlist failed.

Please try again later

Remove from wishlist failed.

Please try again later

Adding to library failed

Please try again

Follow podcast failed

Unfollow podcast failed

Recursion - The Walls of the Computable

Listen for free

View show details

Summary

Maya Chen explores how self-reference creates fundamental limits in mathematics and computation through Gödel's incompleteness theorems, Church's theorem, and Turing's halting problem. These three independent proofs reveal that recursive systems powerful enough to describe themselves inevitably expose logical boundaries they cannot cross.

Loved this episode? Discover more original shows from the Quiet Please Network at QuietPlease.ai, explore our curated favorites here amzn.to/42YoQGI, and catch just a slice of our AI hosts in action on Instagram at instagram.com/claredelish and YouTube at youtube.com/@DIYHOMEGARDENTV

This content was created in partnership and with the help of Artificial Intelligence AI

This episode includes AI-generated content.

No reviews yet