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

Church's lambda calculus and undecidability

  • theory

Alonzo Church used the lambda calculus and related formal work in the 1930s to investigate effective calculability. His 1936 undecidability result showed that there is no general mechanical procedure for solving the decision problem for first-order logic. Lambda calculus represents computation through abstraction and application, making substitution central to evaluation. Church’s result helped establish that limits on algorithms can be proved mathematically, rather than attributed only to inadequate hardware. Alan Turing reached a corresponding negative result through a different model. Their convergence supports the conceptual framework connecting formally defined computation with the intuitive idea of an effective procedure. **Timeline anchor:** 1 April 1936 CE. Approximate day. **References:** [Source 1](https://en.wikipedia.org/wiki/Lambda_calculus), [Source 2](https://en.wikipedia.org/wiki/Alonzo_Church).

Sources

Related

On other timelines

Open Church's lambda calculus and undecidability in the timeline