Early Theory
1930s–1950s · Turing & Birth of Computing
Before electronic computers existed, mathematicians were already exploring a profound question: Can machines "think"? This question led to the emergence of theoretical foundations that laid the mathematical and logical groundwork for the later birth of artificial intelligence. The pioneers of this era—Turing, Church, Gödel—their work was not merely mathematical exploration but also philosophical inquiry into the nature of human mind.
This era’s theoretical exploration can be divided into three main threads: the development of computing theory (driven by Turing and Church), the limits of formal logic (Gödel’s work), and the birth of information theory (Shannon’s contribution). These three directions interweave to form the theoretical cornerstone of artificial intelligence.
Key Milestones
Gödel’s Incompleteness Theorems
Kurt Gödel published his incompleteness theorems, proving that any sufficiently powerful formal system contains propositions that cannot be proven or disproven within that system. This discovery not only shocked the mathematical community but also had profound implications for computing theory and artificial intelligence.
Kurt Gödel (1906–1978)
Church-Turing Thesis
Alonzo Church and Alan Turing independently proposed the famous Church-Turing Thesis. This thesis asserts that any effectively computable function is Turing-computable. This formalizes the intuitive notion of "computability" and became the foundation of computer science.
Alonzo Church & Alan Turing
Turing Machine
Alan Turing introduced the concept of the Turing machine in his landmark paper "On Computable Numbers, with an Application to the Entscheidungsproblem". This abstract computational model can simulate any mathematically computable process.
Alan Turing (1912–1954)
Lambda Calculus
Alonzo Church proposed Lambda Calculus, a formal system for function definition and application. Lambda Calculus is regarded as the theoretical foundation of functional programming. The original 1936 lambda calculus was untyped; Church added simple types in 1940 ("A Formulation of the Simple Theory of Types"), creating one of the earliest explicitly-typed systems.
Alonzo Church (1903–1995)
Neuron Model
Warren McCulloch and Walter Pitts published "A Logical Calculus of the Ideas Immanent in Nervous Activity", introducing the first artificial neuron model (McCulloch-Pitts neuron). This model simplified neurons to binary threshold switches, laying the foundation for later neural network research.
Warren McCulloch & Walter Pitts
Cybernetics
Norbert Wiener published "Cybernetics: Or Control and Communication in the Animal and the Machine", founding the new discipline of cybernetics. The study of how systems regulate themselves through feedback mechanisms had profound impact on AI and robotics.
Norbert Wiener (1894–1964)
Shannon’s Information Theory
Claude Shannon published "A Mathematical Theory of Communication", laying the foundation for information theory. Concepts like entropy, coding, and information quantity became core tools for understanding data and processing information.
Claude Shannon (1916–2001)
Turing Test
In "Computing Machinery and Intelligence," Turing replaced the ambiguous question "Can machines think?" with the imitation game, originally a three-role game (a man, a woman, and an interrogator) where Turing proposed substituting a machine for one of the players. It is a behavioral criterion, not proof that a machine is conscious.
Alan Turing
The 1955 Dartmouth Proposal
In 1955, John McCarthy, Marvin Minsky, Nathaniel Rochester, and Claude Shannon used the term "artificial intelligence" in the proposal for the Dartmouth Summer Research Project and outlined a summer 1956 research program.
John McCarthy et al.
Key Figures
Alan Turing
Father of Computer Science
Turing was not only the founder of computer science but also a pioneer of artificial intelligence thought. His Turing machine model laid the foundation for computing theory, and the Turing Test provided a benchmark for intelligent machines. During WWII, his work helped decrypt the German Enigma code. In 1954, Turing died after being persecuted for his homosexuality. In 2013, Queen Elizabeth II granted him a posthumous royal pardon.
Alonzo Church
Father of Lambda Calculus
Church was a professor at Princeton University. His Lambda Calculus is the theoretical foundation of functional programming. Turing completed his doctorate under him at Princeton. In 1936 each of them had independently given a definition of computability, later named the Church-Turing Thesis, which remains central to computing theory.
Kurt Gödel
Logician
Gödel’s Incompleteness Theorems are considered one of the most important mathematical discoveries of the 20th century. They show that even precise systems like mathematics have inherent limitations—a philosophical insight that profoundly impacts AI development.
Claude Shannon
Father of Information Theory
Shannon was not only the founder of information theory but also an early explorer of artificial intelligence. He built a mechanical mouse (Theseus) that could solve mazes—an early learning-machine demonstration. His 1937 master’s thesis "A Symbolic Analysis of Relay and Switching Circuits" is considered foundational to digital switching theory.
Norbert Wiener
Father of Cybernetics
Wiener was a mathematician at MIT who founded cybernetics, an interdisciplinary field. His concept of "feedback" influenced early AI research. He was also one of the first scientists to warn about the dangers such machines might bring, though not the first to fear them: his 1960 essay in Science sets his warning against Samuel Butler’s novel of machines ruling people, written nearly a century earlier.
Classic Quotes
I propose to consider the question, "Can machines think?"
Computing Machinery and Intelligence · Mind 59 (236), 1950, 433–460
Either … the human mind (even within the realm of pure mathematics) infinitely surpasses the powers of any finite machine, or else there exist absolutely unsolvable diophantine problems.
Some basic theorems on the foundations of mathematics and their implications · Gibbs Lecture, 1951; Collected Works III, 1995, p. 310 · Internet Encyclopedia of Philosophy
If we use, to achieve our purposes, a mechanical agency with whose operation we cannot efficiently interfere once we have started it … then we had better be quite sure that the purpose put into the machine is the purpose which we really desire and not merely a colorful imitation of it.
Some Moral and Technical Consequences of Automation · Science 131 (3410), 1960, 1355–1358