Shannon, Wiener, and the language of information
Shannon’s information theory (1948) and Wiener’s cybernetics (1948) gave mathematical vocabulary to control, feedback, and communication.
1940–1955
Foundations
The conceptual origins of intelligent computation: Turing, cybernetics, and the question of thinking machines.
McCulloch and Pitts 1943: the artificial logic neuron
Warren McCulloch and Walter Pitts modeled neurons as binary logical units, seeding artificial neural networks.
Turing 1950: Computing Machinery and Intelligence
Turing’s 1950 paper proposed the “imitation game” and framed the operational question: can machines think?
Turing 1936: machines, computable numbers, and the halting problem
Alan Turing defined an abstract model of computation and proved the undecidability of the halting problem, founding computer science.
Gödel 1931: incompleteness and the limits of formalism
Kurt Gödel’s incompleteness theorems showed that no sufficiently rich formal system can capture all arithmetic truth.
Hilbert’s Entscheidungsproblem and the dream of deciding everything
David Hilbert asked whether a finite procedure can decide any mathematical statement; the negative answer opened computability theory.
Ada Lovelace and the Analytical Engine: first published algorithm
In 1843, Ada Lovelace described an algorithm for Babbage’s machine and distinguished numeric calculation from symbol manipulation.
George Boole and the algebra of logic
In 1854, George Boole published The Laws of Thought, turning logic into an algebra that underpins circuits and digital computing.
Leibniz and the dream of the calculus ratiocinator
In the 17th–18th centuries, Leibniz imagined a universal language and a calculus of reasoning that anticipate symbolic AI.
Aristotle and syllogistic logic: deep roots of AI
Aristotle’s 4th-century BCE syllogistic logic supplied formal inference rules that later inspired automated reasoning.