factual

Halting Problem Gives Simplest Gödel Proof

Gödel's incompleteness theorem follows immediately from the undecidability of the halting problem without needing the Gödel sentence: a complete computable axiomatization of elementary mathematics would let a theorem-enumeration machine solve the halting problem by waiting for either the halt or non-halt statement, which is impossible.

factualpending

Speaker

Joel David Hamkins

Evidence Quote

“I view this as the simplest proof of Godel's theorem. You don't need the Godel sentence to prove Godel's theorem. You can do it with the halting problem.”

Source

Joel David Hamkins— Lex Fridman Podcast
Created: 6/13/2026, 3:33:58 AM

Your notes

Loading notes...