Great Mathematicians · Modern
Kurt Gödel: Incompleteness
How a 25-year-old in Vienna proved that any consistent formal system rich enough for arithmetic has true but unprovable statements and can't prove its own consistency, ending Hilbert's program and seeding Turing's computability.
Step 1 of 6 · Overview30 min read ·
Key idea
Prereqs: Logic & proofs; Cantor; Hilbert. Next: Turing; information theory. Sources: Ernest Nagel & James Newman, *Gödel's Proof* (1958); Rebecca Goldstein, *Incompleteness* (2005); Veritasium.Next: 1. Life