P
polytropos
Guest
Affirming the consequent is a formal fallacy of making an argument of the form:
(P1) If P, then Q.
(P2) Q.
(C) P.
On the Turing test, Wikipedia says:
I allow that the Turing test seems useful to define or determine a criteria for what it would mean for a machine to “think.” If a machine passes the Turing test, then we can call it “artificially intelligent.”
The fallacy crops up when one tries to use the Turing test to determine that machine’s behaving like us implies that the machine thinks like us. We have an argument of the form:
(P1) If X thinks, then X can behave as though it thinks.
(P2) X behaves as though it thinks.
(C) X thinks.
(P1) seems reasonable given our experience. We think, and our behavior determines what it would mean for something to behave as though it thinks. Likewise, we can grant (P2), that a machine capable of behaving as though it thinks is conceivable. But the issue is that this line of reasoning is the straightforward fallacy of affirming the consequent.
Notice that this is a fallacy regardless of the definition of thinking - so we need not be hung up by the definition. If we define thinking in terms of function and behavior, then we trivially get:
(P1’) If X behaves as though it thinks, then X can behave as though it thinks.
(P2) X behaves as though it thinks.
(C’) X behaves as though it thinks.
(P1’) has been transformed into a tautology by this move, and (C’) is now trivial.
(P1) If P, then Q.
(P2) Q.
(C) P.
On the Turing test, Wikipedia says:
In other terms, thinking is a subjective process that cannot be observed. The Turing test aims to avoid this difficulty by determining not whether machines do think (for that cannot be observed directly) but rather whether machines can act as though they think.The test was introduced by Alan Turing in his 1950 paper “Computing Machinery and Intelligence,” which opens with the words: “I propose to consider the question, ‘Can machines think?’” Because “thinking” is difficult to define, Turing chooses to “replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.”[3] Turing’s new question is: “Are there imaginable digital computers which would do well in the imitation game?”[4] This question, Turing believed, is one that can actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that “machines can think”.[5]
I allow that the Turing test seems useful to define or determine a criteria for what it would mean for a machine to “think.” If a machine passes the Turing test, then we can call it “artificially intelligent.”
The fallacy crops up when one tries to use the Turing test to determine that machine’s behaving like us implies that the machine thinks like us. We have an argument of the form:
(P1) If X thinks, then X can behave as though it thinks.
(P2) X behaves as though it thinks.
(C) X thinks.
(P1) seems reasonable given our experience. We think, and our behavior determines what it would mean for something to behave as though it thinks. Likewise, we can grant (P2), that a machine capable of behaving as though it thinks is conceivable. But the issue is that this line of reasoning is the straightforward fallacy of affirming the consequent.
Notice that this is a fallacy regardless of the definition of thinking - so we need not be hung up by the definition. If we define thinking in terms of function and behavior, then we trivially get:
(P1’) If X behaves as though it thinks, then X can behave as though it thinks.
(P2) X behaves as though it thinks.
(C’) X behaves as though it thinks.
(P1’) has been transformed into a tautology by this move, and (C’) is now trivial.