# AI — The Road to General Intelligence

Canonical URL: https://shipslides.com/d/catalog-tech-ai-revolution
Raw viewer URL: https://content.shipslides.com/d/catalog-tech-ai-revolution/raw
Category: Technology
Slides: 13
Updated: 2026-05-17T20:55:47.165Z
Tags: catalog, tech, revolution

## Summary

From the first artificial neuron sketched in 1943 to large language models trained on most of the public internet — eight decades of one idea, scaled. Key sections include: AI The road to general intelligence.; McCulloch & Pitts: the artificial neuron.; The Dartmouth Workshop coins "artificial intelligence."; Rosenblatt's Perceptron: a learning machine.; Minsky & Papert show perceptron limits. The first AI winter follows.; Backpropagation re-emerges.; Deep Blue beats Garry Kasparov.; AlexNet wins ImageNet. The deep learning era begins.; "Attention Is All You Need."; GPT-3: 175B parameters and the scaling laws..

## Slide Outline

1. AI The road to general intelligence.
2. McCulloch & Pitts: the artificial neuron.
3. The Dartmouth Workshop coins "artificial intelligence."
4. Rosenblatt's Perceptron: a learning machine.
5. Minsky & Papert show perceptron limits. The first AI winter follows.
6. Backpropagation re-emerges.
7. Deep Blue beats Garry Kasparov.
8. AlexNet wins ImageNet. The deep learning era begins.
9. "Attention Is All You Need."
10. GPT-3: 175B parameters and the scaling laws.
11. ChatGPT launches. 100 million users in two months.
12. The open questions.
13. Further reading and watching.

## Slide Transcript

### Slide 1: AI
The road to general intelligence.

- A 13-slide history
- From the first artificial neuron sketched in 1943 to large language models trained on most of the public internet — eight decades of one idea, scaled.
- Press → to begin · F for fullscreen

### Slide 2: McCulloch & Pitts: the artificial neuron.

- Origin
- 1943
- Neurophysiologist Warren McCulloch and logician Walter Pitts publish "A Logical Calculus of the Ideas Immanent in Nervous Activity." They prove that simple threshold units, wired together, can compute any logical proposition.
- Binary inputs → weighted sum → threshold → binary output.
- Networks of these units are Turing-complete in the limit.
- The conceptual seed of every neural net that follows.
- A single threshold unit
- If Σ w·x ≥ θ, fire. Otherwise, stay silent.

### Slide 3: The Dartmouth Workshop coins "artificial intelligence."

- Naming the field
- 1956
- A summer gathering at Dartmouth College, organized by John McCarthy, Marvin Minsky, Nathaniel Rochester, and Claude Shannon, declared a new field. The proposal claimed that "every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it."
- Premise
- Intelligence as computation.
- Attendees
- 10 researchers, 8 weeks, no guarantees.
- Outcome
- A name, a community, and 70 years of follow-up.

### Slide 4: Rosenblatt's Perceptron: a learning machine.

- Learning
- 1957
- Frank Rosenblatt, at Cornell Aeronautical Laboratory, builds the Mark I Perceptron — a physical machine of motors, potentiometers, and a 20×20 photocell array. Crucially, it adjusts its own weights from examples.
- The first algorithm with a convergence proof for linearly separable data.
- The New York Times reported a machine that would "walk, talk, see, write, reproduce itself."
- Reality was more modest. The idea endured.
- Perceptron update rule
- w ← w + η(y − ŷ)x

### Slide 5: Minsky & Papert show perceptron limits.
The first AI winter follows.

- Setback
- 1969
- The book Perceptrons proves a single-layer perceptron cannot learn XOR — or any non-linearly-separable function. The technical result was narrow. Its cultural effect was not.
- Funding shifts toward symbolic AI and expert systems.
- Connectionism enters a long fallow period.
- Multilayer networks could fix this — but no one yet knew how to train them.

### Slide 6: Backpropagation re-emerges.

- Revival
- 1986
- Rumelhart, Hinton, and Williams publish "Learning representations by back-propagating errors" in Nature. Multilayer networks become trainable: the chain rule, applied recursively, sends a useful gradient back through every layer.
- Hidden units learn distributed representations.
- XOR, suddenly, is trivial.
- The path to deep learning is now technically open — but compute is the bottleneck.
- A 3-layer network

### Slide 7: Deep Blue beats Garry Kasparov.

- Public moment
- 1997
- IBM's Deep Blue defeats the reigning world chess champion 3.5 to 2.5 in a six-game match. It is a triumph of brute-force search — 200 million positions per second — paired with hand-crafted evaluation. Symbolic AI's last great stand.
- 200M
- positions evaluated per second.
- 3.5 – 2.5
- match score, May 11, 1997.
- neural networks involved.

### Slide 8: AlexNet wins ImageNet.
The deep learning era begins.

- Inflection
- 2012
- Krizhevsky, Sutskever, and Hinton train an 8-layer convolutional network on two consumer GPUs. Top-5 error on ImageNet drops from 26% to 15.3%. Within five years, every serious computer-vision system is a deep neural network.
- GPUs turn out to be embarrassingly well suited to matrix multiplication.
- ReLU activations and dropout fix old training pathologies.
- The "scale + data + compute" recipe is now legible.

### Slide 9: "Attention Is All You Need."

- Architecture
- 2017
- Vaswani et al. at Google publish the Transformer: a sequence model built entirely from self-attention, with no recurrence and no convolution. It parallelizes beautifully on GPUs, scales gracefully with data, and quietly becomes the backbone of nearly every modern AI system.
- Self-attention: every token can look at every other token.
- Positional encodings replace recurrence.
- Within five years: language, vision, audio, code, biology — all Transformers.
- Attention matrix (toy)
- Each row: how much one token attends to every other.

### Slide 10: GPT-3: 175B parameters and the scaling laws.

- Scale
- 2020
- OpenAI shows that an autoregressive Transformer, trained on much of the public internet, becomes a capable few-shot learner without any task-specific fine-tuning. Kaplan et al. quantify the trend: loss falls as a clean power law in compute, data, and parameters.
- Capability emerges from scale, not from clever architecture tweaks.
- "Just train a bigger one" becomes a research program.
- The economics of AI flip from labs to data centers.
- Loss vs. compute (log-log)

### Slide 11: ChatGPT launches.
100 million users in two months.

- Public moment
- 2022
- Released as a "research preview" on November 30, 2022, ChatGPT becomes the fastest-growing consumer application in history. The breakthrough was not raw capability — GPT-3.5 had existed for months — but interface: a chat box, free, with a model tuned by RLHF to be useful and to refuse less.
- 5 days
- to 1 million users.
- 2 months
- to 100 million users.
- cost to try, at launch.

### Slide 12: The open questions.

- Now
- Eight decades in, the field is louder than ever and less certain than it sounds. Three threads worth watching:
- Alignment
- How do you make a system that pursues the goal you actually meant — including in situations its training data did not cover?
- Generality
- Are LLMs a stepping stone to AGI, or a powerful but bounded technology that needs new ingredients (memory, planning, embodiment)?
- Takeoff speed
- Does capability accelerate smoothly, or does recursive self-improvement create a discontinuous jump? The answer changes everything else.

### Slide 13: Further reading and watching.

- Further reading
- A short, opinionated list. Each YouTube link is a search query — the top results stay reasonably current.
- "Attention Is All You Need" (Vaswani et al., 2017)
- arxiv.org/abs/1706.03762
- Watch: youtube.com / transformer attention is all you need
- Geoffrey Hinton on the history and future of neural nets
- The man who refused to give up on backprop, then on deep learning, then on scale.
- Watch: youtube.com / geoffrey hinton lecture
- Russell & Norvig, Artificial Intelligence: A Modern Approach
- The standard textbook. Read chapters 1, 18, and 21 first.
- Kaplan et al., "Scaling Laws for Neural Language Models" (2020)
- arxiv.org/abs/2001.08361 · the empirical curve that turned a research bet into a strategy.
- ← to revisit · Home to start over · thank you.


## Related Decks

- [Biotechnology — Editing biology like software](https://shipslides.com/d/catalog-tech-biotech)
- [COMPUTING / a brief history](https://shipslides.com/d/catalog-tech-computing-history)
- [Cryptography / Declassified](https://shipslides.com/d/catalog-tech-cryptography)
- [THE INTERNET // A FIFTY-YEAR HISTORY](https://shipslides.com/d/catalog-tech-internet-history)