The XOR problem and the first "AI winter" critique of perceptrons
History of AI / foundations of deep learningIn 1969, Marvin Minsky and Seymour Papert published Perceptrons, proving that a single-layer perceptron cannot learn the XOR function because its four labeled points are not linearly separable. At the time, single-layer perceptrons were the dominant trainable neural model, and this result was widely read as a fundamental limitation of neural networks.
The eventual resolution was architectural: adding a hidden layer of just 2 units lets the network first map the XOR inputs into a new 2D space where the classes become linearly separable, after which a final linear output layer can solve the problem. Backpropagation (popularized in the mid-1980s by Rumelhart, Hinton, and Williams) provided a practical algorithm for training such multi-layer networks end-to-end.
A minimal 2-2-1 MLP (2 inputs, 2 hidden ReLU/sigmoid units, 1 output) solves XOR with 100% accuracy on the 4 truth-table examples, something no single-layer perceptron can do for any choice of weights. This single example reframed the field’s understanding: the limitation was not "neural networks," but specifically linear, single-layer networks — motivating decades of subsequent work on deeper architectures and ultimately today’s deep learning systems.
Source: Neural Networks and Deep Learning, Ch. 1 ("Perceptrons" and the XOR limitation) — Nielsen, M. A.