bang! bang! he murdered math! {the musical!}
summary
A musical retelling that states concrete results and consequences: Gödel’s two incompleteness theorems — any consistent formal system that expresses arithmetic is necessarily incomplete and cannot prove its own consistency — and the undecidable halting problem that rules out a general program verifier. Historical tools and outcomes appear: Enigma is cracked, Von Neumann’s stored‑program machines work, Shor’s algorithm can break RSA if large quantum computers arrive, P vs NP remains open and a $1,000,000 bounty awaits a solution.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:02Lawless numbers plague world
- 2:05Magicians and paradoxes
- 3:29Bang bang revolving evolver
- 4:11Gödel’s incompleteness theorems
- 5:35Hilbert’s unprovable truths
- 6:16Wild west of foundations
- 7:19Machines that dream
- 8:27Computers secure and wreck cities
- 9:10Von Neumann’s bomb and games
- 10:13Halting problem and NP complexity
- 11:38P vs NP problem
- 12:22Math’s last answers unattainable
