factual

Gödel Incompleteness via Complexity

Gödel's incompleteness theorem can be proved using algorithmic complexity (Chaitin): a sequence is random if the shortest program generating it is about as long as itself, and since no program can generate something more complex than the program, you cannot derive theorems more complex than your axioms ('10 pounds of theorems from 5 pounds of axioms'), so any logical system has true statements beyond its complexity horizon that it cannot prove.

factualpending

Speaker

John Allen Paulos

Evidence Quote

“You can't generate 10 pounds of Theorems from five pounds of Axioms”

Source

216 | John Allen Paulos on Numbers, Narratives, and Numeracy— Sean Carroll's Mindscape
Created: 6/13/2026, 12:13:15 AM

Your notes

Loading notes...