factual
Incompleteness via the Halting Problem
A simplified version of Godel's incompleteness theorem states that there is no computably axiomatizable theory of arithmetic that is true and proves all and only the true statements of arithmetic; this follows from the undecidability of the halting problem, because such a complete true theory would let us decide halting by searching for proofs that a program halts or not, contradicting Turing's 1936 result.
factualpending
Speaker
Joel HamkinsEvidence Quote
“if there were a theory that knew all the answers, then we could solve the halting problem. But we can't solve the halting problem because that's what Turing proved in 1936.”
Created: 6/13/2026, 12:16:57 AM
Your notes
Loading notes...