Gödel's Incompleteness Theorems
Concept
A set of theorems stating that any formal axiomatic system, if consistent, is incomplete; Penrose discusses their implications for computation and understanding.
Mentioned in 2 videos
Save the 2 videos on Gödel's Incompleteness Theorems to your own pod.
Sign up free to keep building your knowledge base on Gödel's Incompleteness Theorems as more episodes are added.
Videos Mentioning Gödel's Incompleteness Theorems
Roger Penrose: Physics of Consciousness and the Infinite Universe | Lex Fridman Podcast #85
Lex Fridman
A set of theorems stating that any formal axiomatic system, if consistent, is incomplete; Penrose discusses their implications for computation and understanding.
Scott Aaronson on Computational Complexity Theory and Quantum Computers
Y Combinator
Theorems stating that formal systems for arithmetic, like set theory, cannot be both complete and consistent; relevant to the unknowability of certain Busy Beaver numbers.