Gödel’s Incompleteness Theorems
Era: Early Theory · 1930s–1950s
Kurt Gödel published his incompleteness theorems, proving that any sufficiently powerful formal system contains propositions that cannot be proven or disproven within that system. This discovery not only shocked the mathematical community but also had profound implications for computing theory and artificial intelligence.
Kurt Gödel (1906–1978)
Sources and support
On Formally Undecidable Propositions of Principia Mathematica and Related Systems
Springer · Source type: paper
Gödel’s 1931 paper establishes the first incompleteness theorem.
Published: ·Accessed: