Babbage conceives the Analytical Engine
In 1834, Charles Babbage conceived a programmable general-purpose computing engine, later called the Analytical Engine.
AI timeline
How artificial intelligence evolved: from scientific foundations to modern capabilities.
Last published:
Events
Found: 141
Before 1900
The Origins of Artificial Intelligence
For centuries, philosophers, mathematicians, and inventors explored the possibility of creating thinking machines. Advances in formal logic, mechanical computing devices, and early programming concepts laid the foundation for artificial intelligence.
1834
1843
Publication of Ada Lovelace’s notes on the Analytical Engine
In 1843, Ada Lovelace published notes describing a sequence of operations for computing Bernoulli numbers on the proposed Analytical Engine. She also considered operations on other objects whose relationships could be expressed in a suitable formal representation.
1847
Boole publishes The Mathematical Analysis of Logic
George Boole presented an algebraic approach to logic, allowing propositions and arguments to be analyzed through equations.
1879
Frege publishes Begriffsschrift
Gottlob Frege presented a formal language of relations and quantification with an axiomatic calculus. It allowed reasoning with nested quantifiers to be expressed explicitly.
1900–1942
The Mathematical Foundations of Intelligence
Advances in mathematical logic and computation theory established the scientific foundations of AI. Researchers began exploring the capabilities of algorithms, the principles of computation, and the limits of what machines could solve.
1901
Pearson formulates principal component analysis
Karl Pearson formulated principal component analysis (PCA) as approximating data through projections that minimize the sum of squared errors.
1911
The law of effect in Animal Intelligence
In Animal Intelligence: Experimental Studies, Thorndike presented the law of effect: satisfaction or discomfort accompanying or closely following a response changes its likelihood of recurring in the same situation.
1920
Witness functions in Skolem’s proof
In his 1920 paper, Skolem uses functions that select witnesses for each tuple of universally quantified variables in a proof of satisfiability over a finite or countably infinite domain.
1924
Schönfinkel’s paper on eliminating variables is published
In September 1924, Mathematische Annalen published Schönfinkel’s paper on eliminating bound variables using combinators.
1930
Herbrand’s theorem
Herbrand showed that an entailment from a first-order knowledge base can be proved using a finite subset of its ground instances.
Gödel publishes the completeness theorem for first-order logic
Gödel published a proof of completeness for first-order logic: every logically valid formula has a formal proof.
1932
Church published a logical system using lambda notation
Church’s paper “A Set of Postulates for the Foundation of Logic” appeared in Annals of Mathematics. It described a logical system using lambda notation to represent sets.
1935
Gentzen’s calculi and cut elimination
Gerhard Gentzen developed natural deduction and sequent calculus and proved the cut-elimination theorem.
1936
Turing described a universal computing machine
Turing described a machine capable of reading encoded descriptions of other machines and reproducing their computations.
Fisher publishes a seminal paper on discriminant analysis
Fisher used iris data in his work on discriminant analysis and introduced the term discriminant function.
1940
Church formulates simple type theory
In 1940, Alonzo Church presented a formulation of simple type theory with functions as primitive objects and lambda notation as its sole variable-binding mechanism.
1943–1955
The First Models of Artificial Intelligence
Mathematical models of artificial neurons emerge alongside early research into machine learning. Advances in cybernetics and computing technology open new possibilities for creating systems capable of simulating aspects of human thought.
1943
McCulloch and Pitts’s logical model of neural networks
In December 1943, Warren McCulloch and Walter Pitts published a logical account of neural networks. They showed how to construct networks that realize logical expressions under specified conditions.
1949
Hebb’s learning principle in The Organization of Behavior
In The Organization of Behavior (1949), Donald Hebb proposed that a neuron’s repeated or persistent participation in firing another neuron increases its effectiveness in doing so.
Metropolis and Ulam describe the Monte Carlo method
Metropolis and Ulam presented a statistical approach to difficult computations: examining a random sample of trials or trajectories instead of calculating every possibility.
1950
Turing proposes the imitation game
In Computing Machinery and Intelligence, Turing proposed replacing the question “Can machines think?” with a game in which an interrogator judges a machine's written answers.
Shannon describes search and position evaluation for computer chess
Shannon published a chess-program design combining position evaluation with minimax move selection. He also described selective search as a way to reduce enumeration.
1953
Metropolis algorithm published
Metropolis and colleagues described sampling configurations from the Boltzmann distribution through random particle displacements with acceptance or rejection of proposed moves.
1954
Davis implements Presburger's decision procedure
Martin Davis implemented Presburger's decision procedure in a program that performed an automated proof.
The Georgetown–IBM machine translation demonstration
On January 7, 1954, IBM and Georgetown University publicly demonstrated automatic translation of Russian sentences into English on an IBM 701.
Farley and Clark describe a digital simulation of a learning network
In September 1954, B. G. Farley and W. A. Clark published a study of a digitally simulated self-organizing network. Starting from a random initial state, it learned to distinguish two fixed input patterns by changing connection weights.
1955
Prior publishes Diodoran Modalities
Arthur Prior published the first study of his tense logic, introducing future-time operators into propositional calculus.
The Dartmouth proposal on artificial intelligence
The proposal dated August 31, 1955 outlined a shared research program in artificial intelligence. It initiated the 1956 Dartmouth summer research project.
Successful hand simulation of the Logic Theorist method
According to Newell and Simon, the first successful hand simulation of a theorem proof using methods later incorporated into Logic Theorist took place on December 15, 1955.
1956–1973
The Birth of AI as a Scientific Field
Artificial intelligence emerges as a distinct scientific discipline. Early programs capable of logical reasoning, problem-solving, and natural language interaction inspire a wave of optimism about the future of intelligent machines.
1956
Logic Theorist proves theorems on a computer
In 1956, Logic Theorist became a working program for proving theorems in symbolic logic.
Dartmouth Summer Research Project on Artificial Intelligence
In 1956, a small group of scientists gathered for the Dartmouth Summer Research Project on Artificial Intelligence. The meeting was a seminal event in the emergence of AI as a research field.
1958
The NSS chess program and game-tree pruning
Newell, Shaw, and Simon studied a chess program that used a game-tree pruning method.
Publication of the A* heuristic search algorithm
Stanford Research InstituteWhat happened
A* selects the open node with the lowest sum of these estimates. For the graphs considered, whose edge costs have a positive lower bound, the paper proves that it finds a minimum-cost path to a reachable goal when the heuristic does not overestimate the remaining cost.
Why it matters
The work incorporated domain knowledge into a formal search theory with a minimum-cost solution guarantee. Later research documents the use of A* in motion planning, including humanoid footstep planning.
Sources
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Supporting excerpt
from s to a preferred goal node of s. In fact, We shall take as our evaluation function to be used in A* f(n) -f(s) for every node n on an optimal path, and f(n) > f(s) for every node n not on an optimal path. Thus, f(n) = A(n) + Ai(n) (2) although f(n) is not known a priori (in fact, determination where g(n) is the cost of the path from s to n with minimum of the true value of f(n) may be the main problem of inter- cost so far found by A *, and J(n) is any estimate of the est), it seems reasona
- Peter Hart — Technical Highlights
Supporting excerpt
Theory Society. The A* algorithm for finding the shortest path through a graph The A* algorithm is guaranteed to find the shortest path through a graph, and does so with minimum computation. It was first described, and its admissibility and optimality properties proved, in: Hart, P. E., N. J. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs," IEEE Trans. on Systems Science and Cybernetics, Vol. SSC-4, No. 2, pp 100-107, (July 1968). In addi
- Speeding Up Search-Based Motion Planning using Expansion Delay Heuristics
Supporting excerpt
domain compare hed with a The Feed-Forward network used has three hidden layers and baseline heuristic hb which is the cost of the optimal path in uses an adam optimizer with a learning rate of 0.001. We (x,y) space but with regular euclidean 2D edge-costs. We use trained feature-target pairs taken from at least 25 random A* with hb as the heuristic function to obtain training data, 530 Figure 3: Results with hb using w=100 (left), hb using w=10000 (center) and hed (right). Left footsteps are ma
Sources last checked: