Mathematicians spent the early 20th century trying to build a complete, airtight foundation for all of mathematics. Then Kurt Gödel constructed a single sentence that essentially says 'I cannot be proved' — and showed that if the system is consistent, that sentence must be true yet forever beyond proof. The same self-referential idea would go on to define the limits of every computer ever built.
The best on-ramp: how a quest to put all of mathematics on unshakable foundations led instead to a proof that some true things can never be proven — and how that same idea birthed the computer.
Marcus du Sautoy animates the core trick in five minutes: a mathematical sentence engineered to say 'this statement cannot be proved,' and why that sentence detonates Hilbert's dream.
The formal record: any consistent system strong enough for arithmetic is incomplete, and no such system can prove its own consistency. The precise claims everyone misquotes.
The link to computer science made explicit — how self-reference, the halting problem, and the limits of what any machine can decide all spring from the same well as Gödel's proof.
Quanta walks step by step through Gödel numbering — the scheme that lets arithmetic talk about itself — and shows exactly how the self-referential sentence is built. The mechanism, not the metaphor.
The Stanford Encyclopedia sorts the real philosophical weight from a century of overreach — minds vs. machines, the fate of Hilbert's program, and all the things Gödel is wrongly said to prove.