CONCEPTS & TURNING POINTS / 2 MIN READ
Preconditions and Foundations of AI (Antiquity–1940s)
On this page
Artificial intelligence has deep roots in ancient ideas, formal logic, and the mathematics of computation. This sub-article expands Section 1 of History.
Ancient and Medieval Ideas
- Myths and automata — Hephaestus’ golden servants, the Jewish Golem, and medieval clockwork figures expressed the dream of constructed intelligence.
- Formal reasoning — Aristotle’s syllogisms, Ramón Lull’s combinatorial “thinking machines,” and Leibniz’s characteristica universalis sought a universal language of thought.
The Logic and Mathematics of Computation
- Symbolic logic — Boole’s algebra of logic (1847) and Frege’s predicate calculus formalized reasoning.
- Computability theory (1930s) — Alan Turing’s machines, Alonzo Church’s lambda calculus, and Gödel’s incompleteness theorems defined the limits of what can be computed.
- Information theory — Shannon’s A Mathematical Theory of Communication (1948) provided the quantitative backbone for later AI.
Early Hardware and Computation
- Mechanical and electromechanical computers — from Babbage’s analytical engine to relay-based and early electronic machines.
- War-time computing — codebreaking machines (e.g., the Colossus) demonstrated practical computation at scale.
Why These Foundations Matter
AI inherited three streams: the dream of artificial minds, the formalism of symbolic logic, and the engineering of computation. All later paradigms—symbolic, statistical, and neural—build on these.
Sources
- Turing, A. M. (1936). On Computable Numbers.
- Shannon, C. E. (1948). A Mathematical Theory of Communication.
- Leibniz, G. W. Dissertatio de Arte Combinatoria (1666).
Back to History · See Cybernetics.