AI history

How did we get to today’s AI?

100 milestones · 1904 to today · each checked in at least 2 sources

Every milestone, oldest first

100 milestones

Foundations · 1900–1949

AI is born · 1950–1975

Expert systems, networks and learning · 1976–1999

Data, GPUs and deep learning · 2000–2016

The transformer era · 2017–today

Back to the timeline
Computers

Gödel’s theorems show the limits of mathematical proof

Kurt Gödel proved that any rule system without contradictions, if strong enough for basic arithmetic, has statements it can neither prove nor disprove. Such a system also cannot prove that it is free of contradictions.

Why it mattersIt badly damaged David Hilbert’s plan to prove mathematics complete and free of contradictions, and it shaped Alan Turing’s work on computation.

Note Sources give January 1931 (Stanford Encyclopedia) or December 1931 (the journal issue). Gödel first announced the first theorem on 7 September 1930, at a conference in Königsberg.

Who and what
  • Kurt Gödel
  • University of Vienna
  • Mathematical logic
  • Incompleteness theorems
We count only the page and your answer.Thank you. We counted only this page and your answer.
Next · LearnHow today’s AI models work: a short course

Checked 4 October 2026Corrections