CHAPTER 08/1987–2005

Winter and Quiet Sprouts

In the shadow of shrinking knowledge-writing AI, neural networks that learn from data grew (1987–2005)

The business of AI that writes in experts' knowledge shrank, and a second was said to have arrived. But in those same years, neural networks, which imitate the connections between brain cells, kept producing techniques that lead straight to today. In this chapter we run those mechanisms one by one to check them.

011984–1996 · United States

Measuring the Winter's Chill in Numbers

Did the winter that people worried about in 1984 really come?

In August 1984, at a panel discussion at the conference of the American Association for Artificial Intelligence (AAAI), the chair, Drew McDermott, described a . In about five years, the Defense Department's would fail, startups would go bankrupt, and funding for AI would dry up. He introduced this state as what some call . But he also said that he did not think it very likely.

The figure on the right shows the American data that followed. AAAI membership peaked at 16,421 in 1987 and fell to 4,000–5,000 by 1996. Sales of products at Symbolics, which developed Lisp machines (computers built specially for AI), dropped from $101.6 million to $55.6 million between fiscal 1986 and fiscal 1988. Numbers with different units can be compared too, once you set each peak to 100.

Scaled value=number in that year ÷ number in the peak year × 100
Peak
the year with the highest value
What you think you knowThe popular story:The 1984 panel accurately predicted the AI winter
The original source says:The chair presented it as a and said it was not very likely. Much of the scenario did happen, but not all at once five years later.

What the figure shows:The AI winter discussed in 1984 as a “worst case scenario” did not arrive all at once 5 years later, but through declining membership and sales over several years.

021987–2003 · Japan

Did Winter Never Come to Japan?

While people in the US spoke of a winter, how was Japan doing?

In March 1991, the , supervised by the Ministry of International Trade and Industry, wrote that Japan (translated). Fuzzy theory (a theory for handling vagueness) was popular in Japan, and in 1990 the word won the gold prize in the New Word category of the Japan New Words and Buzzwords Awards.

One basis for the white paper was a survey in 1989. The share that had adopted AI was 26.2% of the responding computer-using establishments, 80.5% of the members of the AI center, and 37.8% overall. But of the 7,084 places that were sent the questionnaire, only 1,844 answered. In the figure on the right, see how the share changes depending on whom you ask.

Switch the figure to the academic society's membership, and corporate members and the like peaked at 155 companies in 1991 and 1992, then fell to 49 by 2003. Winter seems to have come to Japan late and slowly.

Share among those who answered=number that adopted ÷ number that answered
Lower bound
the share if every place that did not answer had not adopted (number that adopted ÷ number sent)
What you think you knowThe popular story:After the second boom, Japan entered winter at the same time as the world
The original source says:The 1991 white paper, supervised by the government, wrote that Japan had not entered a winter like America's. Corporate membership in the academic society began to fall only in the report for 1993, after that.

What the figure shows:A 1991 white paper said Japan had no winter, but the percentage supporting that claim changes greatly with who was surveyed. Society membership suggests that Japan's winter came slowly and later.

031992–1995 · Japan's national programs

From Symbols to Learning

After the Fifth Generation, what did Japan's national programs aim for?

In 1995, three of Japan's national programs ended together: the Fifth Generation project, which aimed at computers that reason with logic; the Japan Electronic Dictionary Research Institute (EDR, 1986–1995), which built a huge dictionary for computers by hand; and LIFE (1989–1995), which handled vagueness.

Earlier, in 1992, the Ministry of International Trade and Industry had started a 10-year program, . According to Nobuyuki Otsu, who led it, the Fifth Generation pursued the (translated), whereas RWC pursued the (translated), that is, it aimed at technology that handles vague information such as images and sound flexibly through learning.

Move "Current year" in the figure on the right, and the aim of the programs under way that year shifts from symbols to patterns and learning.

Average per year=total money ÷ number of years
Average
the value smoothed by dividing by the number of years; the same amount was not spent every year

What the figure shows:After the Fifth Generation project, based on symbols and logic, Japan's national project shifted toward patterns and learning, aiming to handle images and speech flexibly through learning.

041982 · Neural networks

Falling Into an Energy Valley

Why does a network that recalls always settle somewhere?

In April 1982, the physicist John Hopfield presented a network in which all neurons, each taking a value of +1 or −1, are connected to one another. The strength of each connection is the same in both directions. Neurons are updated one at a time, according to the sign of the sum of the input they receive from the others.

Using the physics idea of studying the properties of magnets, the paper defined a number called energy for each state. Every time one neuron is updated, the energy goes down or stays the same. So it always stops at the bottom of some valley in the end. If you make the learned patterns the bottoms of valleys, then even starting from a corrupted pattern, the network falls into a nearby valley and recalls the pattern.

In the graph under the figure on the right, check that the energy never goes up. The paper wrote that the network can store patterns up to about 0.15 times the number of neurons, N.

E= −½ Σi≠j wij si sj  si ← sign(Σj wij sj)
si
value of neuron i (+1 or −1)
wij
strength of the connection between i and j (the same in both directions)
E
total energy
What you think you knowThe popular story:Hopfield built the first associative-memory network in 1982
The original source says:His own paper cites earlier work, including Shun-ichi Amari (1977, 1978). In 1972, Kaoru Nakano and Shun-ichi Amari had published a similar mechanism (Chapter 5).

What the figure shows:Each update of 1 neuron lowers the energy or leaves it unchanged, so the network always stops at the bottom of a valley. Placing stored patterns at valley bottoms lets it recall them from damaged patterns.

Energy after each single update
051985 · Neural networks

Neurons That Move by Chance

What do we do when we get stuck in a shallow valley?

A Hopfield network can only go downhill. In the Boltzmann machine of Ackley, Hinton, and Sejnowski (1985), neurons choose on or off by probability, so the network can sometimes go uphill too. What sets the randomness is the temperature T. If you lower the temperature gradually, the network tends to settle at low energy (the same idea as annealing in physics).

In the figure on the right, press "Anneal (cool slowly)" and "Quench" several times, and compare how often each reaches the deepest valley.

The paper also gave a rule for training networks with hidden neurons. It compares the probability that two neurons are on at the same time when the data are shown and held fixed with when the network runs freely, and corrects the weights by the difference. At first the calculation took so long that it was not very useful (the Nobel Committee's explainer, 2024).

P(on)=1/(1+e−ΔE/T)  Δwij ∝ p+ij − p−ij
ΔE
the energy drop if the neuron turns on
T
temperature
p+, p−
probability of being on at the same time when fixed and when free
What you think you knowThe popular story:Training networks with hidden layers began with backpropagation in 1986
The original source says:The 1985 Boltzmann machine paper had already given a learning rule for networks with hidden neurons.

What the figure shows:Moving only downhill leaves a system stuck in a shallow valley. A Boltzmann machine sometimes moves uphill by chance, and gradually lowering its temperature makes it more likely to reach a deep valley.

Energy as the network runs
061986 · Neural networks

Connecting Only Between Two Layers

What gets easier if we do not connect neurons within the same layer?

In 1986, in Chapter 6 of Volume 1 of the book “Parallel Distributed Processing (PDP)”, Paul Smolensky proposed a neural network called a harmonium. It divides the neurons into a visible layer and a hidden layer and connects them only between the layers. In a footnote he also wrote that it is a special case of the Boltzmann machine in which . Today it is called the restricted Boltzmann machine (RBM).

Because there are no connections within a layer, once one layer is fixed, the other can be computed all at once. "One round trip (up, then down)" in the figure on the right updates each layer simultaneously. A network that has learned a striped pattern restores a corrupted image in a few round trips.

In 2002, Hinton presented a fast method that trains with one round trip (contrastive divergence) (Chapter 9).

P(hj=1|v)=σ(bj +Σi wij vi)
v
visible layer
h
hidden layer
σ
a function that converts a value to 0–1
b
bias
What you think you knowThe popular story:Hinton built the restricted Boltzmann machine for deep learning in the 2000s
The original source says:Hinton himself wrote in his 2002 paper that the restricted form was put forward by Smolensky (1986). The work of the 2000s was a way to train it fast and a way to stack it into deep networks.

What the figure shows:Connecting only between 2 layers, with no connections within either layer, means that once one layer is set, the other can be calculated all at once.

071967–1986 · How to learn

Walking Down the Slope of Error

How do you improve a model with many weights, little by little?

The error of a learning machine becomes a single number once the weights are fixed. Put the weights along the horizontal and vertical axes, and you get a landscape with hills and valleys. Gradient descent is a method that reduces the error by moving a little at a time in the direction of steepest descent (opposite to the gradient).

Click the landscape on the right to place a ball and let it roll down. If one step (the learning rate η) is too big, the ball jumps over the valley, and if it is bigger still, it flies out. If you compute "Per single example", the path wobbles, but each step is cheap to compute (stochastic gradient descent).

In 1967, Shun-ichi Amari studied in theory a learning method that updates the weights a little each time it sees one example, and in a 1968 explainer in Japanese he called it the “stochastic descent method”. The backpropagation of 1986 also uses this idea of walking down a slope.

w ← w − η ∂L/ ∂w
L
size of the error
∂L/ ∂w
how L changes when w is moved a little (the gradient)
η
learning rate
What you think you knowThe popular story:Training down to the hidden layers started with backpropagation in 1986
The original source says:Amari himself (2025) and the introduction of his Kyoto Prize say that the 1967 theory was already an idea of training with gradients, hidden layers included. This site has not been able to confirm the text of the 1967 paper.

What the figure shows:If error is shown as a landscape of weights, learning means taking small steps in the steepest downhill direction. A step that is too large jumps over the valley, and a still larger step flies out of it.

Number of updates and size of the error (the vertical axis is in steps of 10 times)
081986 · Neural networks

Passing the Error Backward

How should the weights of a hidden layer be corrected?

In October 1986, in a paper in Nature, David Rumelhart, Geoffrey Hinton, and Ronald Williams presented a way to train neural networks that have a hidden layer between input and output. It takes the error at the output and passes it back step by step from the output side to the input side, dividing the error among the neurons of the hidden layer and correcting the weights little by little (backpropagation).

Let the network in the figure on the right learn XOR, which the one-layer perceptron could not learn in Chapter 5. Each neuron in the hidden layer draws its own boundary line (the dotted lines), and the network sorts XOR between the lines. If you reduce the hidden layer to one neuron, it cannot learn.

The paper itself writes that by Parker and by Le Cun.

δout =(y − t)y(1 − y)  δj =δout wj hj(1 − hj)
y, t
output value and correct answer
hj, wj
value of hidden neuron j and its weight to the output
δ
the share of error assigned
What you think you knowThe popular story:Hinton invented backpropagation
The original source says:The paper itself writes that others had found it independently too. The Nobel Committee's explainer (2024) also calls it a reinvention: Rumelhart, Hinton, and Williams “reinvented a scheme for this,” and what mattered was showing that a network with a hidden layer can solve tasks that cannot be solved without that layer.

What the figure shows:A network with hidden layers can solve XOR, which 1 layer cannot solve, by passing output errors backward and adjusting its weights.

Size of the error at each training round
091985–1987 · Neural networks

Squeezing Eight Patterns Into Three

Can we make a network build a code without preparing correct answers separately?

A network with a narrow middle layer is trained on the task of outputting the same thing it receives. A pattern in which exactly one of 8 inputs is 1 is passed through 3 hidden neurons and mapped to the same 8 outputs. The network has no choice but to assign a set of 3 values (a code) to each of the 8 patterns by itself.

This task appeared in the 1985 Boltzmann machine paper as the encoder problem, and it was trained in the backpropagation chapter of the 1986 book too. According to the chapter, the hidden neurons used not only 0 and 1 but in-between values. In the figure on the right, watch the 8 patterns scatter to different places on a cube.

In 1987, Dana Ballard put forward a way to stack such networks. Today they are called autoencoders (self-encoders).

code z=σ(W1x)  output y=σ(W2z)  reconstruction error=Σ(y − x)²
x, z
input (8 units), hidden layer (3 units)
W1, W2
weights of the first half (encoder), second half (decoder)
What you think you knowThe popular story:Hinton started autoencoders in 2006
The original source says:They already existed in 1985–1987. The 2006 paper in Science also writes that it had been “obvious since the 1980s” that deep autoencoders work well.

What the figure shows:Training a network to squeeze 8 inputs into 3 and then restore them lets it create its own code without being taught the correct answers.

Reconstruction error at each training iteration
101986–1990 · Neural networks

Feeding In the Previous Self

How does a network remember characters that come in order?

In 1990, Elman added context units to a three-layer neural network. The values of the hidden layer are copied as they are into the context units and fed in with the input at the next time step (a recurrent neural network, RNN). The copying connections were fixed at weight 1.

When the network is asked to predict the next character in a string with no word breaks, the prediction error is large at the start of a word and gets smaller as the word goes on. Without being taught, the word boundaries emerge. The figure on the right is an example this site made by lining up 5 words. Only the purple bar (the first character) stays high.

Elman himself writes that this idea begins with Jordan's 1986 report.

ht =tanh(W xt +U ht−1)
xt
the character at time t
ht−1
the hidden layer one step earlier
U
connections from the context units
What you think you knowThe popular story:Elman invented the RNN in 1990
The original source says:Elman's paper itself says the idea was first written by Jordan (1986), and cites earlier examples. The Nobel Committee's explainer says Hopfield networks are also recurrent.

What the figure shows:Feeding the network's previous state back alongside the next input makes word boundaries emerge from a sequence of letters without marked breaks or explicit teaching.

Which letter of the word it is, and the average prediction error
111989 · Convolution

Reusing the Same Window

How do we build a neural network that can read handwritten digits even when their position is slightly off?

In 1989, Yann LeCun and six others at Bell Labs trained a neural network to recognize digits, using 9,298 handwritten digits of ZIP codes on American envelopes. The key was to reuse the same small 5×5 window (a filter that finds a feature) at many places in the image (in today's words, convolution).

In the figure on the right, choose a window and shift the digit. Places that match the window's shape respond, and the places that respond move along with the digit. Because the window is reused, the number of weights to learn drops sharply (the number at the upper right).

On the 2,007 test examples, the error rate was 5.0%. The paper cites Kunihiko Fukushima's 1980 paper (the Neocognitron) in just one place.

map(x, y)=Σi,j k(i, j)× picture(x+i, y+j)
k
the window (5×5 weights; the same at every place)
What you think you knowThe popular story:Deep learning for image recognition (convolution) was born in America
The original source says:LeCun and colleagues themselves wrote in 1998 that . The difference was that the Neocognitron had no way to train the whole network (backpropagation).

What the figure shows:Reusing the same small window across an image finds the same shape even when a digit shifts slightly, and greatly reduces the number of weights to learn.

121989–1998 · Convolution

Passing Unsure Characters to a Person

Can a machine that makes 5% errors not be used in a bank?

The network that read ZIP codes in 1989 made errors on 5.0% of the test data. The paper also pointed out that to hold the error rate to 1%, 12.1% would have to be rejected as “unreadable.” If you pass the answers with low confidence to a person, errors among the answers the machine does give go down. In the figure on the right, move the rejection line θ.

In 1998, LeCun and colleagues put together LeNet-5, a seven-layer convolutional neural network, and a system that reads checks. The system was built into NCR check-reading machines and used at several American banks. On MNIST, the handwritten-digit dataset of that paper (60,000 training and 10,000 test examples), the error rate was 0.95%.

Rejection rate=number with confidence<θ ÷ total number
θ
the line that sets the rejection standard
confidence
the largest of the output values

The way confidence splits in the figure is an example this site made, to come close to two points from the 1989 paper.

What you think you knowThe popular story:Deep learning started to be useful in 2012
The original source says:In the late 1990s, convolutional neural networks were already doing real work, reading checks in banks.

What the figure shows:Even a machine with a 5% error rate can greatly reduce errors among the answers it gives by passing low-confidence cases to people.

Rejection rate, and error rate among the answers given
131990 · Machine translation

Probabilities From Parallel Text

Can we gather clues for translation without writing a dictionary or grammar?

In June 1990, Peter Brown, Frederick Jelinek, and six others at IBM presented a method that treats translation as a calculation of probabilities. Their material was the records of the Canadian Parliament, kept in both English and French (about 100 million English words).

There were pairs of sentences that translate each other, but nothing said which word translates which. So the paper adopted the EM algorithm, used in speech recognition. At first it assumes that every word is equally likely to translate every other word, and then repeats a calculation that recounts using those probabilities. Press "Repeat once" in the figure on the right (the sentence pairs are an example this site made).

From 40,000 sentence pairs, the paper estimated about 81 million numbers and wrote that “the” was automatically linked to “le” and “la,” and “not” to “pas.” Of the translations of 73 new sentences, 5% were word-for-word identical to a reference and 48% were sensible translations.

share=t(f|e)÷ Σe′ t(f|e′)
t(f | e)
probability that English word e is translated as French word f
e′
all the English words in the same sentence pair

What the figure shows:Even with translated sentence pairs that do not mark which words match, starting with roughly equal probabilities and repeatedly recounting lets the correct word pairs emerge naturally.

141991 · Neural networks

Splitting the Work Among Experts

What happens if one neural network learns many different jobs?

When one network learns many different jobs, they get in each other's way and learning slows down. In 1991, Robert Jacobs, Michael Jordan, Steven Nowlan, and Geoffrey Hinton answered this problem by combining several expert networks with a gating network that outputs the probability of which expert to hand the job to.

They measured error in a way that makes the experts compete rather than cooperate, so each expert comes to handle only part of the input data. The figure on the right is an example in which two experts, who can each draw only a straight line, learn a pattern of points whose shape differs on the left and right. The band at the bottom shows the gate.

In 2017, a large-scale mechanism was also built that picks just the top few from thousands of experts (Chapter 11).

y=Σk gk yk  gk =esk /Σm esm
yk
output of expert k
gk
probability that the gate hands the job to k (they sum to 1)
What you think you knowThe popular story:The mixture of experts (MoE) is a new trick for the large language models of recent years
The original source says:The basic idea was in the 1991 paper. The 2017 paper itself writes that there had been much research on this method .

What the figure shows:Making 1 network do many different jobs causes the jobs to interfere. Competition lets experts divide up the work, each taking responsibility for only part of it.

Average error at each iteration
151992–1997 · Reinforcement learning

Learning Only From Wins and Losses

Can a program learn strong play without being told the right move at each turn?

In TD-Gammon, made by IBM's Gerald Tesauro in 1992, a three-layer neural network played hundreds of thousands of games of backgammon against itself and learned only from wins and losses (reinforcement learning). The version that played 1.5 million games came within one point of the former world champion, Bill Robertie, in a 40-game match.

The key is temporal difference (TD). At every move, it nudges its prediction of how likely a position is to win a little closer to the prediction for the next position. The final win or loss is passed back, bit by bit, to earlier positions. The figure on the right does the same learning on tic-tac-toe. You can also play against it as × by pressing an empty square.

In August 1997, the Othello world champion Takeshi Murakami lost 0–6 to Logistello, a program that had learned by self-play and other means. Logistello ran on an ordinary personal computer.

V(st)← V(st)+α[V(st+1)− V(st)]
V(s)
predicted chance of winning from position s
α
how far to move the prediction closer
What you think you knowThe popular story:AI changed how people play starting with AlphaGo in Go (2016)
The original source says:Nilsson's book quotes a passage saying that in the 1990s, top backgammon players copied TD-Gammon and changed the way they play the opening.

What the figure shows:Without being taught the right answer at each move, repeatedly moving the current prediction a little closer to the next position's prediction carries wins and losses back to earlier positions and improves play.

200 games against an opponent that plays at random (purple=losses, gray=draws)
161992–1995 · Machine learning

The Middle of the Widest Road

When many boundary lines can separate the data, which one is best?

Vladimir Vapnik and colleagues reasoned that if you draw the line down the middle of the widest road that stays as far as possible from both kinds of data, it will also classify data it has never seen well. Half the width of the road is called the margin.

What fixes the boundary line is only the few points that touch the edge of the road (support vectors=the points that support the road). In the figure on the right, pull the points. If you move a point with a ring, the road changes, but if you move the other points, the boundary line does not change as long as they do not enter the road.

On the handwritten digits of MNIST, the method of Corinna Cortes and Vapnik reached an error rate of 1.1%, a result close to LeNet. But identifying one character required about 14 million multiplications and additions.

maximize margin=1/ ‖w‖  subject to: yi(w · xi +b)≥ 1
w, b
parameters that fix the boundary line
yi
group of point i (+1 or −1)
What you think you knowThe popular story:Neural networks were the main players all along after the 1980s
The original source says:In the decade around 2000, methods other than neural networks, such as support vector machines, took over many practical classification tasks (Schmidhuber, 2014).

What the figure shows:Many lines can separate 2 groups, but the middle of the widest road, furthest from both sides, is a good choice. Only the few points touching the road's edges determine that line.

171997 · Neural networks

A Memory Box and Its Gates

How can a network remember a clue from long ago?

When a recurrent network is trained with backpropagation, the error signal is multiplied by a similar number every time it goes back one step in time. If the number is less than 1 it vanishes, and if it is greater it blows up. Sepp Hochreiter analyzed this problem in 1991.

In 1997, the LSTM of Hochreiter and Jürgen Schmidhuber was equipped with a . What is in the box is connected to itself with weight 1 and carried along without vanishing. An input gate and an output gate open and close to put things in and take them out (the 1997 version has just these two gates). Press "Flow" in the figure on the right. The paper wrote that it could use clues more than 1,000 steps apart.

ct =ct−1 +it × gt  ht =ot × h(ct)
c
contents of the box
i, o
input gate and output gate (0–1)
g
the value to put in

The weights of the LSTM in the figure were set by hand by this site (not trained). The graph below, opened with “Details”, shows the error signal that remains when it is multiplied by the “Multiplier” at each step.

What the figure shows:In an ordinary recurrent network, the signal fades through multiplication each time it travels backward. LSTM carries a memory box unchanged with weight 1 and uses gates to put information in and take it out, allowing distant clues to be remembered.

Number of steps back and the signal that remains (the vertical axis is in steps of 10 times)
181994–1997 · Search

Cutting Off Branches Not Worth Reading

Did a computer that examines about 200 million positions a second read them all?

In May 1997 in New York, IBM's chess computer Deep Blue beat the world champion Garry Kasparov two wins to one with three draws (3.5 to 2.5). Its strength came from brute-force calculation examining about 200 million positions a second, and from records of grandmasters' games.

Even so, it cannot read everything (the combinatorial explosion of Chapter 5). Alpha-beta pruning cuts off, without reading further, any branch once it is known that the opponent has a better move. In the figure on the right, compare the number of leaves read. The answer stays the same while the number read goes down.

The prediction by Herbert Simon and colleagues (1957) that came true about 40 years later, in a different form (Chapter 3).

once α ≥ β, do not read the rest of that branch
α
the lowest score you have already secured
β
the highest score the opponent will let you take
What you think you knowThe popular story:Deep Blue's victory was a victory for AI
The original source says:IBM itself wrote on its page at the time, and explained that it became strong through enormous computation and records of grandmasters' games.

What the figure shows:Alpha–beta search stops exploring a branch once it knows the opponent has a better move elsewhere. It reduces the number of positions examined while keeping the same answer.

191985–2005 · Robots

Moving Without Thinking First

Can a robot with no map move all around a room?

In September 1985, Rodney Brooks of MIT presented a way to design a robot's behavior in layers. Layers of higher-level behavior are stacked on lower layers (such as not bumping into things), and an upper layer suppresses a lower layer only when needed. In a 1991 paper he wrote that .

The announcement materials for the Roomba robot vacuum cleaner, released in 2002 at $199.95, also say nothing about a map. It repeats spiral, wall-following, and straight-line runs, and passes over each part of a room 2 to 5 times. In the figure on the right, add and remove layers (the room is an example this site made).

In Japan, Sony's AIBO was announced in 1999 and Honda's ASIMO in 2000.

movement it outputs=the movement of the topmost layer that is active now
layer
a group of behaviors such as going straight, following a wall, or spiraling
What you think you knowThe popular story:During the AI winter of the late 1980s to the 1990s, research itself stopped
The original source says:At the same time, Brooks, while writing about the state of the winter, showed another path of building intelligence from the body and its movement, and built robots that move around.

What the figure shows:Even without a map, a robot can repeatedly cover a whole room just by layering behaviors such as turning after a collision, following walls, and moving in spirals.

Share of floor covered (purple=along walls, green=center)
201993–2005 · Predictions

Extending the “Doubling” Line Forward

From the rise in computer performance, can we predict the year it matches the brain?

In 1998, Hans Moravec of Carnegie Mellon University estimated that the work of a human brain needs about 100 million MIPS (1 MIPS is one million instructions per second). He then predicted that the necessary hardware would be . He also wrote that 1960–1990 was .

The predicted year moves a great deal depending on how you set the doubling time. According to the paper, in 1990 an inexpensive personal computer gave 1 MIPS for $1,000. The doubling time was 18 months in the 1980s and 12 months in the late 1990s. Try changing the time in the figure on the right.

In 1993, Vernor Vinge wrote, .

year reached=1990+doubling time (years) × log2(100 million)
log2(100 million)
about 26.6 (how many times you must double to get a factor of 100 million)
What you think you knowThe popular story:The Singularity is Kurzweil's idea (2045)
The original source says:Vinge called it the Singularity in 1993 and wrote that superhuman intelligence would come between 2005 and 2030. Vinge himself notes that the word goes back to von Neumann and the idea to I. J. Good.

What the figure shows:Extending a line of repeatedly doubling performance predicts a year when it will match the brain. But changing only the assumed number of months per doubling can shift that year by decades.

Closing

What This Chapter Still Can't Tell Us

America's , judging from society membership and company sales, took years to arrive, starting in the late 1980s. In Japan, the national white paper of 1991 wrote that Japan had not entered a (translated), but how the use of AI in Japan changed after 1991, and when winter came to Japan (or whether it came at all), is still unclear. We have also not found a source that counts whether the item in the 1984 scenario, , really happened.

In the same era, almost all the technologies that lead to modern AI had appeared: Hopfield networks, Boltzmann machines and restricted Boltzmann machines, backpropagation, networks that squeeze the input into a narrow layer (the prototype of the autoencoder), recurrent networks and LSTM, convolution, mixtures of experts, support vector machines, and TD learning, which learns from games against itself. But why TD-Gammon learned so well was not explained by the theory of the time. Whether the real brain works like a Hopfield network has not been confirmed either.

One of the things that was missing may have been computing power. In 1998, Moravec wrote that seeds long said to be fruitless were suddenly sprouting. In the next chapter, from 2006, the third boom begins, in which deep neural networks “learn by themselves from data.”

Other events in this chapter (1; all with original sources and confidence grades)
1983–1984Verified in the originalSources disagree

When McCarthy gave MYCIN a male patient's amniotic fluid, it accepted it just like that ── recorded by the developers themselves in a book note

A well-known story is often told as an example of the weakness of AI that has experts' knowledge written into it: it does not know the (things taken for granted) that was not written in. A note in the MYCIN book (1984) says that John McCarthy entered that the culture site (the source of the test material) of a male patient was amniotic fluid, and that MYCIN accepted it without noticing the mistake. McCarthy's web paper (1984) does not have this story, but it describes the lack of common sense: MYCIN has no outlook on what happens after treatment, and cannot answer

The popular story:A story is told that McCarthy teased MYCIN (a rumor), and Nilsson also writes
The original source says:The people who built MYCIN themselves wrote this episode in a note in their 1984 book, citing . However, McCarthy's web paper does not have the story and describes other lacks of common sense (such as no outlook on what happens after treatment).

What we still don’t know:I have not confirmed which text or lecture specifically refers to.

3 sources and how they were checked

Where sources disagree:Small differences in the story: Nilsson writes that the entry was a male who had had amniocentesis. The MYCIN book writes that the culture site of a male patient was amniotic fluid.

  1. Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project, Chapter 36 Major Lessons from This Work (note 18) (Bruce G. Buchanan, Edward H. Shortliffe · 1984 · p.692 Note 18 · The person’s own later recollection)
  2. Some Expert Systems Need Common Sense (web version, 1984; section COMMON SENSE KNOWLEDGE) (John McCarthy · 1984 · node2.html(COMMON SENSE KNOWLEDGE) · Original source)
  3. The Quest for Artificial Intelligence (Nils J. Nilsson · 2010 · p.407 24.3 Acknowledged Shortcomings · Secondary summary)