The first AI winter (1970s): promises vs. reality
British government cuts (Lighthill report) and DARPA pullbacks chilled AI after oversized 1960s expectations.
Sorted by date · America/Guayaquil timezone
Latest signals
Page 37 / 38 · 447 articles
SHRDLU (1970): natural language in a blocks world
Terry Winograd’s SHRDLU combined parsing, planning, and a micro-world to converse about manipulable blocks.
Minsky and Papert 1969: Perceptrons and the brake on connectionism
The book Perceptrons argued severe limits of single-layer networks and helped eclipse neural nets for a time.
Rosenblatt’s Perceptron (1958): learning in hardware
Frank Rosenblatt introduced the Perceptron, a learning machine that adjusts weights from examples—an emblem of the first connectionist boom.
Dartmouth 1956: the term Artificial Intelligence is born
The 1956 Dartmouth workshop, proposed by John McCarthy and colleagues, coined “artificial intelligence” and launched the field.
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.
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.