Scores by kind of claim
Each kind of claim is scored on its own, out of 100: the share that held up, with the range it likely falls in. Fewer resolved claims give a wider range.
-
Factual claims
Statements about the present or the past, checked against the record: did they hold up?
68 61 75 -
Predictions
Statements about events outside the person's control, checked once they fell due: did they come true?
42 25 60 -
Promises
Commitments to the person's or organisation's own future action, with something to deliver: was it delivered?
Insufficient record: 0 promises resolved, 5 needed for a score.
All types combined: 65 (likely 58 to 71, high confidence), from 78 claims: 69 factual claims, 9 predictions. It mixes kinds of claim in different proportions for different people, so compare people kind by kind.
Ray Kurzweil's claims
24 claims
“That book proved a theorem that perceptrons couldn’t distinguish a connected figure — in which all parts are connected to each other — from a disconnected figure, something a human can do easily.”
Ray Kurzweil, book reviewer in NYT March 2017 How we'll end up merging with our technology (Kurzweil Library / NYT)
Minsky and Papert's book Perceptrons proved a theorem that perceptrons cannot distinguish connected from disconnected figures.
Mostly true True in substance, wrong in a detail.
What would count as true or false
True: Minsky and Papert's 'Perceptrons' (1969) contains a proven theorem showing that perceptrons, of the kind the book defines (e.g., with bounded order or diameter), cannot compute the connectedness predicate, that is, cannot distinguish connected from disconnected figures. Mostly true: the book proves this for the defined class under conditions the claim leaves out, but the core result matches. Mixed: the book discusses connectedness as a limitation, but the formal result differs materially from what is stated. Mostly false: the connectedness result is only conjectured or informally argued, or it concerns a substantially different property. False: the book contains no such result.
Evidence
- [PDF] Perceptions - Famous Deep Learning Papers Minsky and Papert, Perceptrons: An Introduction to Computational Geometry (expanded edition text, hosted at papers.baulab.info) · 1969
“whether or not all the parts of any geometric figure are connected to one another!”
- Perceptrons (book) - Wikipedia Wikipedia · 3 June 2008
“showed that the order required for a perceptron to compute connectivity grew with the input size (Theorem 5.5).[18][17]”
- Perceptrons (book) - Wikipedia Wikipedia · 3 June 2008
“The most important one is related to the computation of some predicates, such as the XOR function, and also the important connectedness predicate.”
- [PDF] 3 Weighted Networks – The Perceptron R. Rojas, Neural Networks, Springer-Verlag, Berlin · 1996
“Proposition 6. No diameter limited perceptron can decide whether a geometric figure is connected or not.”
Reasoning
E2 reports that Perceptrons proved (Theorem 5.5) that the order a perceptron needs to compute connectivity grows with input size, and E3 lists connectedness among the book's main limitation results. E4 states that no diameter-limited perceptron can decide whether a figure is connected. The core result matches the claim, but it holds only for perceptrons of bounded order or limited diameter, a condition the claim leaves out.
Cite this claim
Ray Kurzweil, “Minsky and Papert's book Perceptrons proved a theorem that perceptrons cannot distinguish connected from disconnected figures.” (said March 2017). Verdict: mostly true. Reliability API, claim c_a17a2bae51c3, method 0.1.0+28da144b. https://epistacklabs.com/claims/c_a17a2bae51c3
Claims without a verdict
Is a verdict here wrong, or do you speak for Ray Kurzweil? Reply on the claim's own page, with the form at its foot (how replies work). Verdicts are made automatically; how verdicts and scores are made.