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
PRIMES is in P
theory
Manindra Agrawal, Neeraj Kayal and Nitin Saxena announced a deterministic polynomial-time primality test in 2002. Their AKS result proved that deciding whether an integer is prime belongs to the complexity class P without relying on unproved hypotheses. The achievement concerns a worst-case theoretical guarantee. Practical primality testing had already made extensive use of efficient probabilistic and specialized methods, so the theorem did not mean that testing primes suddenly became possible for the first time. It is also distinct from factoring: deciding that a number is composite does not automatically reveal its prime factors. **Timeline anchor:** 1 August 2002 CE. Approximate day. **References:** [Source 1](https://en.wikipedia.org/wiki/AKS_primality_test).