The AI Winter Started With a Math Proof: Marvin Minsky and the XOR Problem
Nirmal Utwani
SubscribeSign in
The AI Winter Started With a Math Proof: Marvin Minsky and the XOR Problem<br>Week 04 of the Turing Award Series — how proving what single-layer networks can't do led to everything they can<br>Nirmal Utwani<br>Jun 11, 2026
Share
Week 04 of my learning series on Turing Award winners: Marvin Minsky.<br>Marvin Minsky, along with John McCarthy, was hugely pivotal in starting AI as a field. They organized the Dartmouth conference in 1956, got the best minds in the room, named the discipline of AI, and then went off and built the two institutions that shaped everything after: Minsky at MIT, McCarthy at Stanford.<br>The MIT AI Lab is still running today as CSAIL.
My Take
The first highlight is moving from flat lists of rules to structured knowledge. Before his frames paper, AI systems stored knowledge as giant if-then rule lists, which doesn’t scale well. Minsky’s intuition was that this is very different than how humans think. When you see a chair, your brain doesn’t rederive what a chair is from scratch every time. It has a mental template made up of four legs, a back, a seat, some material, and you fill in the details. He called that idea of structure “frames”: structured objects with named slots and defaults. This is how most programming languages work today in terms of classes and objects.<br>The second, and the more important one, is his book on perceptrons and their limitations. Rosenblatt’s single-layer network was the hot AI thing in 1958, and there was a lot of optimism that you could scale this infinitely and solve intelligence. Minsky was the party pooper and proved mathematically that regardless of data size or compute, a single layer isn’t enough for a computer to understand even a basic operation like XOR. This did play a big role in the first AI winter: funding dried up, research stalled, the whole neural network agenda lost momentum for nearly a decade. Minsky, to his credit, also explicitly said that multi-layer networks wouldn’t have this problem and pushed researchers towards training them. Backpropagation for multi-layer networks arrived in 1986, which was a big unlock, followed by deep learning. The AI era we know today: H100 clusters, hyperscalers, Mag-7, all training the next frontier models. All of it traces back to Minsky pushing the world towards multi-layer networks.
What He Actually Did
Marvin Minsky won the Turing Award in 1969 “for his central role in creating the science of artificial intelligence.”<br>Two contributions stand out:<br>1. Frames — Structured Knowledge (1974)
Before Minsky’s frames paper, AI systems stored knowledge as giant if-then rule lists. If you wanted a computer to understand what a chair is, you’d write hundreds of rules: “if object has four legs AND has a back AND has a seat, then object is chair.”<br>It doesn’t scale. The rules explode combinatorially.<br>Minsky’s insight: humans don’t work that way. When you see a chair, your brain doesn’t rederive what a chair is from scratch. It has a mental template. Four legs. A back. A seat. Some material. Default values. You fill in the details.<br>He called this structure “frames”: objects with named slots and defaults.<br>Frame: CHAIR<br>slots:<br>legs: 4 (default)<br>back: yes (default)<br>seat: yes (required)<br>material: wood (default)This became the foundation of object-oriented programming. Classes with properties. Inheritance. Defaults. It’s how Python, Java, JavaScript work today.<br>2. Perceptrons — The Limitation That Pushed AI Forward (1969)
In 1958, Frank Rosenblatt built a learning machine called the perceptron. You showed it examples — this input means yes, that input means no — and it adjusted its internal numbers (weights) until it got them right.<br>It had a mathematical guarantee: if a pattern can be separated by a straight line, the perceptron will find the weights.<br>The problem was the fine print: “if a pattern can be separated by a straight line.”<br>The XOR Problem<br>XOR is a simple logic function:<br>0 XOR 0 = 0<br>0 XOR 1 = 1<br>1 XOR 0 = 1<br>1 XOR 1 = 0Plot these four points on a grid. The 1s sit at diagonal corners (0,1) and (1,0). The 0s sit at the other diagonal corners (0,0) and (1,1).<br>No straight line can separate them. Try it. Every line you draw leaves at least one point on the wrong side.<br>A perceptron computes the sign of a linear function: w1·x1 + w2·x2 + b. The decision boundary is a straight line. Since XOR isn’t linearly separable, no perceptron can learn it — ever, no matter how many training rounds you run.<br>Minsky’s Proof<br>Minsky and Papert spent years in the 1960s mapping out exactly which patterns fail. Their 1969 book proved it rigorously.<br>For XOR, the constraints are:<br>(0,1) → 1: w2 + b ≥ 0 → w2 ≥ -b<br>(1,0) → 1: w1 + b ≥ 0 → w1 ≥ -b<br>(0,0) → 0: b From b , say b = -1. Then w1 ≥ 1 and w2 ≥ 1.<br>But then w1 + w2 + b ≥ 1 + 1 - 1 = 1 > 0, so (1,1) fires — contradicting the fourth constraint.<br>No values of w1, w2, b satisfy all four constraints...