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

Euclid's algorithm

  • algorithms

Euclid’s Elements, compiled around 300 BCE in the Greek mathematical tradition, presents a procedure for finding the greatest common divisor of magnitudes or numbers. Repeatedly reducing the larger by the smaller preserves the common divisor until the process reaches a terminating case. Later formulations use division and remainders to perform the same underlying reduction efficiently. The procedure is a classic example of an algorithm whose correctness can be explained through an invariant. Its surviving written form predates electronic computing by more than two millennia, showing that systematic computation is older than the machines now associated with the term. **Timeline anchor:** 1 July 300 BCE. Approximate: about 300 BCE. **References:** [Source 1](https://en.wikipedia.org/wiki/Euclidean_algorithm).

Sources

Open Euclid's algorithm in the timeline