Gödel's theorem
Gödel's incompleteness theorem: any consistent formal system of sufficient power contains true statements it can neither prove nor disprove.
As defined in 216 | John Allen Paulos on Numbers, Narratives, and Numeracy
Other definitions
Kurt Gödel's incompleteness theorem, which proved that any consistent formal system (like arithmetic) cannot prove all true statements within that system; it demonstrated Hilbert's program was impossible.
Stephen Wolfram tackles the big questions—from God and free will to whether AI will destroy us all.
Where it comes up · 6
- Psychedelics, Consciousness, and AI | Richard Dawkins | EP 2561 claim
- 216 | John Allen Paulos on Numbers, Narratives, and Numeracy1 claim
- 28 | Roger Penrose on Spacetime, Consciousness, and the Universe1 claim
- AMA | August 20211 claim
- AMA | March 20211 claim
- Can space and time emerge from simple rules? Stephen Wolfram thinks so. | World Science Festival1 claim
Most important claims · 6 of 6Search all claims for “Gödel's theorem” →
- Gödel's incompleteness theorem can be proved using algorithmic complexity (Chaitin): a sequence is random if the shortest program generating it is about as long as itself, and since no program can generate something more complex than the program, you cannot derive theorems more complex than your axioms ('10 pounds of theorems from 5 pounds of axioms'), so any logical system has true statements beyond its complexity horizon that it cannot prove.216 | John Allen Paulos on Numbers, Narratives, and Numeracy
- Penrose's Gödel-based argument that consciousness is non-computational fails because it assumes humans can 'just see' that a formal system is consistent, but we cannot prove that consistency; the human brain is physical and sloppy, often attributing unwarranted certainty to its thoughts, so the appearance of reaching conclusions a computer cannot is just giving ourselves too much credit.AMA | March 2021
- Mathematical incompleteness (Gödel's theorem) is conceptually similar to computational irreducibility: both indicate fundamental limits to predictability and knowledge in formal systems.Can space and time emerge from simple rules? Stephen Wolfram thinks so. | World Science Festival
- Roger Penrose does not argue that consciousness is implicit in matter, but rather that consciousness stands outside the domain of algorithmic computation due to Gödel's theorem—a different and more specific claim about non-computability.Psychedelics, Consciousness, and AI | Richard Dawkins | EP 256
- Gödel's theorem shows that for any sound formal proof system you trust, one can construct a true statement about numbers that the system cannot derive yet that you can see is true by the very understanding that led you to trust the system; therefore human mathematical understanding cannot be the operation of any fixed algorithm or computation, because we can see truths that lie outside whatever proof procedure we are using.28 | Roger Penrose on Spacetime, Consciousness, and the Universe
- Science, math, and morality are three fundamentally different domains: math posits axioms and proves theorems with many equally consistent systems; science assumes one real world we model under the hypothesis we're not being deceived; but morality is neither — moral constructivism holds that morality systematizes our incoherent built-in moral impulses, so different people can be correctly led to different conclusions and must persuade each other, which differs from relativism because one can still hold others wrong without claiming objective rightness.AMA | August 2021