The Minsky-Papert perceptron theorem applies only to single-layer perceptrons.
Unresolvable The public record could not settle it.
Factual: Statements about the present or the past, checked against the record: did they hold up?
The second judge said mostly false; the verdict shown is the first judge's.
What would count as true or false
True: authoritative sources show the connectedness and related theorems in 'Perceptrons' apply only to single-layer perceptrons (a single layer of adjustable weights over fixed predicates), and that multi-layer networks are not covered. Mostly true: the theorem applies to that single-trainable-layer class but carries other restrictions the claim omits (such as order or diameter limits), and it does not apply to general multi-layer networks. Mixed: the scope is genuinely ambiguous or disputed in the literature. Mostly false: the results also constrain some multi-layer architectures, so 'only' overstates the matter, even though the main thrust concerns single layers. False: the theorem demonstrably applies to multi-layer perceptrons in general.
Set before the research began.
Evidence (4)
-
E1 Perceptrons (book) - Wikipedia Wikipedia · 3 June 2008
“What the book does prove is that in three-layered feed-forward perceptrons (with a so-called "hidden" or "intermediary" layer), it is not possible to compute some predicates unless at least one of the neurons in the first layer of neurons (the "intermediary" layer) is connected with a non-null weight to each and every input”
-
E2 Perceptrons (book) - Wikipedia Wikipedia · 3 June 2008
“In contrast, most of the book discusses two-layered perceptrons where the first layer is made of boolean units.”
-
E3 Chapter 17: The Perceptron's Fall kube-dojo.github.io · 1 January 1996
“A theorem about a defined class of local, single-layer perceptrons is not a theorem about all future multilayer neural networks.”
-
E4 Chapter 9: Minsky and Papert's Analysis bnaskrecki.faculty.wmi.amu.edu.pl (university course notes) · 1 January 2026
“Minsky and Papert were well aware that multi-layer networks could overcome the limitations they proved.”
Reasoning
E3 and E4 indicate the book's limits do not cover multi-layer networks in general, but E1 describes a result the book proves about three-layered perceptrons with a hidden layer, and neither E1 nor E2 says the book's networks have one layer of adjustable weights or names the other restrictions the 'mostly true' grade requires. The evidence therefore does not settle whether the claim is mostly true or mostly false under the criteria.
Cite this claim
Ray Kurzweil, “The Minsky-Papert perceptron theorem applies only to single-layer perceptrons.” (said March 2017). Verdict: unresolvable. Reliability API, claim c_1a14b3b692f8, method 0.1.0+28da144b, dataset release v1.1.2. https://epistacklabs.com/claims/c_1a14b3b692f8
This claim is in dataset release v1.1.2, with the same verdict.
Reply to this claim
More factual claims by Ray Kurzweil
-
Mostly false
“That was not true a year ago. But that’s true today.”
-
Mixed
“AI hallucinations are still there, but are becoming much less frequent.”
AI hallucinations persist but are becoming much less frequent.
-
Mostly true
“And it’s going very, very quickly — at an exponential rate”
AI progress is advancing very quickly, at an exponential rate.
-
Mostly true
“It was not quite as good, but you could recognize it as Mozart or as Chopin.”
-
Mostly true
“Yes, it was very much for AI.”
The prizes received by Geoffrey Hinton and by Demis Hassabis and John Jumper were very much for AI.
Verdicts are made automatically; how verdicts are made.