FREE HISTORY OF COMPUTING
Historical Figures of Computing
Reconstruct computing through 16 source-linked lessons ordered by contribution milestone, then explore a 462-person biography atlas ordered by birth.
Follow the contribution chronology
- c. 5th–4th century BCE: Rules that generate
- 628–c. 825: Numbers become state
- c. 9th century–1206: Mechanisms follow sequences
- 1725–1804: Instructions on cards
- 1837–1843: The general machine
- 1847–1890: Logic and people become data
- 1931–1936: What can be computed?
- 1937: Logic becomes circuit
- 1941–1946: Electronic teams
- 1947: A switch with gain
- 1945–1949: Instructions live in memory
- 1948–1957: Machines translate languages
- 1961–1969: From batch to dialogue
- 1970–1976: Structured state over untrusted networks
- 1978–1991: The open distributed world
- 2009–2022 · provisional history: Data, model, evaluation
Browse the biography atlas by birth era
- Rules before machines: 520 BCE–1316
- Mechanizing reason: 1550–1900
- Foundations converge: 1900–1925
- Computing becomes a field: 1925–1936
- Languages, chips & AI: 1936–1943
- Systems and silicon scale: 1943–1951
- Personal computing arrives: 1951–1956
- Software, security & the web: 1956–1963
- Distributed infrastructure: 1963–1969
- Internet platforms & open source: 1969–1977
- Data, mobile & deep learning: 1977–1983
- Foundation models & AI builders: 1983–1997 births
- Unknown chronology: Identity unknown
Authored computing profiles
- Pāṇini: The Aṣṭādhyāyī: a systematic grammar with interacting rules and metarules
- Euclid: The Elements: geometric proofs, number theory, and the greatest common divisor procedure
- Archimedes: Geometric bounds, large finite number descriptions, and mathematical mechanics
- Heron of Alexandria: Mechanical automata, pneumatic devices, and measurement procedures
- Brahmagupta: Systematic arithmetic with zero and signed quantities; algebra and geometry
- al-Khwārizmī: Systematic algebraic equation procedures and writing on Indian calculation
- Al-Kindi: A cryptanalytic treatise describing frequency analysis and its limitations
- al-Jazarī: Illustrated descriptions of clocks, automata, and hydraulic devices
- Leonardo Fibonacci: Liber Abaci: arithmetic with Hindu-Arabic numerals, practical problems, and algebra
- Ramon Llull: The Art: symbolic figures and combinatorial methods for organizing arguments
- John Napier: Invented logarithms and Napier’s Bones to reduce difficult calculation.
- William Oughtred: Created the slide rule for analog multiplication and division.
- Wilhelm Schickard: Described a calculating instrument in 1623 combining multiplication aids with a six-digit adding mechanism.
- Blaise Pascal: Built the Pascaline, a gear-driven adding machine.
- G. W. Leibniz: Developed binary arithmetic, a decimal stepped-reckoner design, and proposals for calculi of reasoning.
- Basile Bouchon: Used perforated paper for loom pattern selection in Lyon in 1725.
- Joseph-Marie Jacquard: Developed a practical punched-card attachment for selecting weaving patterns, demonstrated in 1801.
- Charles Babbage: Designed difference engines and evolving card-controlled Analytical Engines with separate mill and numerical store.
- Ada Lovelace: Published 1843 Notes explaining the proposed Analytical Engine and a detailed Bernoulli-number program plan.
- George Boole: Developed an algebraic calculus of logic in 1847 and 1854, later revised into modern Boolean algebra.
- William Stanley Jevons: Built the Logic Piano, an early mechanical logic machine presented to the Royal Society in 1870.
- Georg Cantor: Founded set theory and introduced diagonalization.
- Gottlob Frege: Created modern predicate logic and a formal language for reasoning.
- Giuseppe Peano: Published an axiomatic treatment of natural-number arithmetic and influential mathematical notation.
- Herman Hollerith: Developed punched-card tabulation and founded a company incorporated into C-T-R, later IBM.
- Alfred North Whitehead: Co-authored Principia Mathematica to ground mathematics in formal logic.
- David Hilbert: Developed axiomatic methods and a program for finitist consistency proofs; posed foundational decision questions.
- Bertrand Russell: Exposed foundational paradoxes and developed type theory.
- Thomas J. Watson Sr.: C-T-R and IBM leadership from 1914; sales, service and organizational development.
- Jan Łukasiewicz: Developed many-valued logic and Polish prefix notation; contributed to the history of logic.
- L. E. J. Brouwer: Founded intuitionism and made fundamental contributions to topology.
- Percy Ludgate: Published an independent design for a proposed analytical calculating machine in 1909.
- Thoralf Skolem: Advanced model theory and introduced Skolem normal form.
- Vannevar Bush: Led differential-analyzer development and proposed the Memex information system.
- Norbert Wiener: Developed mathematical work on probability and filtering and helped establish cybernetics.
- Emil Post: Developed production systems, models of computation, and the theory of computably enumerable sets.
- Haskell Curry: Developed combinatory logic and connections between formal deduction and typed computation.
- Howard Aiken: Proposed the Harvard Mark I and led computing work in collaboration with IBM engineers and the Harvard crew.
- Arthur Samuel: Pioneered machine-learning experiments with a checkers program, described in a 1959 paper.
- Walter Brattain: Co-invented the point-contact transistor.
- Alonzo Church: Lambda calculus; formal undecidability results; the Church-Turing thesis
- John von Neumann: Contributions to stored-program computer architecture, game theory, and self-reproducing automata
- John Atanasoff: Co-developed the Atanasoff-Berry Computer, an early special-purpose electronic digital computing device
- Andrey Kolmogorov: Axiomatic probability; algorithmic complexity and contributions to algorithmic information theory
- Tommy Flowers: Led the team that designed and built Colossus for wartime codebreaking
- Kurt Gödel: Completeness of first-order logic; incompleteness for consistent, effectively axiomatized theories with sufficient arithmetic
- Grace Hopper: Automatic programming, A-0 routine compilation, FLOW-MATIC, and contributions to business-language development
- John Mauchly: Co-designed ENIAC and UNIVAC with J. Presper Eckert and their teams
- John Bardeen: Co-invented the point-contact transistor and co-developed the BCS theory of superconductivity
- Jacques Herbrand: Herbrand’s theorem connects first-order unsatisfiability with finite ground-instance contradictions
- Stephen Kleene: Regular expressions and finite automata; foundational contributions to recursion theory and the arithmetical hierarchy
- William Shockley: Junction-transistor theory and design; founder of Shockley Semiconductor Laboratory
- Konrad Zuse: Z-series electromechanical computers and the Plankalkül language design
- Frederic C. Williams: Co-developed Williams-Kilburn CRT memory and led work on the Manchester Baby
- Alan Turing: A formal model of computation and universality; undecidability, wartime cryptanalysis, machine intelligence, and morphogenesis
- Maurice Wilkes: Led EDSAC development; proposed microprogramming; co-developed early programming practice with Wheeler, Gill, and the Cambridge team
- Richard Hamming: Hamming codes and distance; error-control coding, numerical methods, and automatic programming
- J. C. R. Licklider: Advocated interactive computing and supported the research community that helped develop computer networking
- Horst Feistel: Feistel block-cipher structure and IBM cryptographic research that contributed to DES
- Claude Shannon: Algebraic analysis of switching circuits; mathematical information theory and secrecy systems