A mathematical neuron
An early mathematical account of how networks of idealized neurons could carry out logical operations.
A history through research and practice
Trace the publications behind the breakthroughs, from mathematical neurons to reasoning models. Open any entry for the research, its significance, and its limits.
Before the research · 1816–1899
The Sandman, Erewhon, and Moxon’s Master explored attachment to artificial beings, machines surpassing humanity, and the loss of human control. Follow those ideas and Turing’s later reference to Butler.
Read the articleExplore the wider cultural history in the separate books and films timeline, from antiquity to 2024.
67 entries across all topics.
No entries match this topic. Choose another topic or clear the filter.
An early mathematical account of how networks of idealized neurons could carry out logical operations.
Cell assemblies and activity-dependent changes connected learning with the organization of neural circuits.
Turing reframed the question of machine intelligence through an operational test based on conversation.
Heuristic search made symbolic theorem proving a concrete computational task.
A trainable model connected adaptive weights with pattern recognition.
Recursive operations on symbolic expressions provided a foundation for Lisp.
A small language system built an internal model from statements and searched it to answer later questions.
A restricted English interface translated algebra story problems into equations and solved for unknowns.
Resolution combined substitution and logical inference in a method designed for computer theorem proving.
Scripted pattern matching produced a convincing surface of conversation.
Linked concepts let a memory support questions that were not specified when its information was stored.
A temporal analogy to holography explored how familiar sequences might be recognized and recalled.
Question answering combined stored facts, relevant retrieval, and deductions that were not explicitly stored.
A mathematical analysis clarified limitations of restricted perceptron architectures.
A system stored the relations in an English story so that it could answer questions about the story later.
The Teachable Language Comprehender related new text to a semantic network and represented what it learned in the same form.
An extended resolution procedure used proofs to construct solutions to formally described problems.
A problem-solving language connected assertions and goals with procedures that controlled inference.
Structured descriptions of objects helped a program interpret a limited class of calculus rate problems.
An interactive system stored facts and relation definitions in a network, with memories that could be saved to disk.
Language, reasoning, and action were integrated in a constrained blocks world.
Early MYCIN research explored rule-based advice in a tightly defined specialist domain.
A mathematical neural model explored conditions under which patterns of activity could persist.
A systematic account connected stored associations, cue-based recall, and adaptive mathematical models.
Storage and retrieval were organized around matching content rather than specifying a memory address.
Recurrent networks linked associative memory with the dynamics of physical systems.
Backpropagation demonstrated how hidden units could learn useful internal representations.
Dynamic networks extended error-based learning from static patterns to time-varying streams.
Feeding earlier hidden activity back into a network created a learned representation of temporal context.
Under stated conditions, feedforward networks can approximate broad classes of functions.
A simple recurrent network learned temporal context sufficient to recognize a studied finite-state grammar.
Self-connected hidden units integrated a sequence while local traces supplied information needed for learning.
Real-time recurrent learning was applied to recognizing sequential structure in finite-state grammars.
Three commercial magazine articles brought neural-network learning to the Commodore 64, giving readers a practical baseline for what AI could do on a home computer.
Margin-based classification offered a powerful approach to nonlinear learning.
Memory cells and gates addressed difficulties in learning long-range dependencies.
Convolutional networks and gradient-based training connected representation learning with document recognition.
Greedy layerwise learning provided an effective training strategy for deep belief networks.
A large, organized image database created new opportunities for visual recognition research.
A consistent software interface made established learning methods easier to use and compare.
GPU-trained convolutional networks substantially improved large-scale image classification.
Efficient training made useful continuous word vectors available at large scale.
A generator and discriminator learned through an adversarial training objective.
Randomly omitting units during training helped reduce overfitting.
A deep Q-network learned control policies from game images and rewards.
Residual learning enabled effective optimization of much deeper image-recognition networks.
Policy and value networks strengthened search in a difficult board game.
A dataflow system supported machine-learning workloads across different computing devices.
The Transformer replaced recurrence with attention in a sequence-to-sequence architecture.
Masked pretraining helped a bidirectional Transformer transfer to many language tasks.
A language model performed several tasks without task-specific parameter updates.
An imperative programming style supported flexible research with efficient tensor computation.
Empirical relationships connected language-model loss with parameters, data, and compute.
A large language model performed many tasks using demonstrations supplied in its prompt.
Learning to reverse gradual noising became an effective image-generation method.
Contrastive learning from image-text pairs enabled transfer through natural-language descriptions.
Performing denoising in a learned latent space reduced the computational burden of image synthesis.
Prompts containing intermediate reasoning examples improved performance on several reasoning benchmarks.
Supervised examples and human preference feedback improved how language models followed instructions.
A simple step-by-step instruction improved reasoning results without worked examples in the prompt.
Written principles guided self-critique and AI-generated feedback during training.
A family of language models emphasized training efficiency and publicly available training data.
A large model accepted image and text inputs and generated text outputs.
Grouped-query and sliding-window attention supported an efficient language-model architecture.
Sparse routing selected two of eight feedforward experts per token at each layer.
Long-context experiments included text, video, and audio within a multimodal model family.
Reinforcement learning improved reasoning benchmarks, with distinct training paths for R1-Zero and R1.
Reading the timeline
Years refer to the specific work linked in each entry. For papers first released on arXiv, the timeline uses the first submission year and notes a later conference when applicable. An invention, a software release, and a paper may have different dates.
Entries summarize a contribution and its limits. Journal papers, conference papers, preprints, technical reports, a foundational monograph, and a commercial magazine series with programs are labeled separately. Being a primary source does not mean every claim has been independently reproduced.
This is a curated history of AI research and practice, not an exhaustive catalogue or a ranking of current models. Era names are editorial navigation, not universally agreed scientific periods. Entries within a year are not necessarily ordered by month.
The selection builds on the MTS research-paper timeline and Tracing the Evolution of Artificial Intelligence, with dates and descriptions checked against the original publications and authoritative records linked on each detail page. The latter review is a preprint; neither overview substitutes for the original evidence.
Source review: 16 September 2026. Historical coverage ends in 2025. External links may lead to a publisher record, an open manuscript, or a PDF; some publishers restrict full-text access.