circagraph
Sign inSign up

The history of computer science

From counting boards and the first algorithms to deep learning: the theory, machines, languages, algorithms, systems, networks, software practice, security and AI that make up computer science, in calendar dates. Moments are tagged and colored by subfield; eras are shown as spans, and links connect ideas to what they led to. Summaries are original; each moment links to its Wikipedia articles as sources. Dates marked approximate say so.

Duration correction: Ongoing subjects previously drawn through a present/research cutoff are represented at their original starts, with no end asserted. Existing moments at those coordinates are reused; their attached cards retain the former duration’s notes, sources, tags and media. Bounded historical and coverage intervals remain durations.

88 moments · 2700-07 BCE – 2022-11-30 CE · by @athan · @athan

Gödel's incompleteness theorems

  • theory

Kurt Gödel’s 1931 incompleteness work established limits on effectively axiomatized formal systems capable of expressing sufficient arithmetic. Under the relevant consistency assumptions, such a system cannot prove every arithmetical truth, and it cannot establish its own consistency in the straightforward way hoped for by earlier foundational programs. The argument encodes statements and proofs arithmetically, allowing mathematical reasoning to address the formal system itself. These results profoundly changed logic and the study of mechanized proof. They do not imply that every statement is undecidable or that ordinary mathematical proof is useless; the limitations concern precisely specified kinds of formal systems. **Timeline anchor:** 1 January 1931 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems).

Sources

On other timelines

Open Gödel's incompleteness theorems in the timeline