Does a submarine swim? A question of decision about a word, not of fact
Do submarines swim? (Chomsky)
The question "can a machine think?" is ill-posed: it is not a question that an experiment, such as the Turing test, can answer.
Asking if a machine thinks is like asking if a submarine swims: we choose how to extend a word, there is no fact to find.
"Does a submarine swim? A question of decision about a word, not of fact" is an argument by Noam Chomsky (Powers and Prospects, 1996, 1996) on the question "Can a machine think?" (answer: an ill-posed question). Its claim: The question "can a machine think?" is ill-posed: it is not a question that an experiment, such as the Turing test, can answer. According to AskPhilosophy's logic check (Z3 solver), the argument is valid only if one grants a premise the author leaves unstated (P4). AskPhilosophy presents 3 objections, 1 of them with a documented reply, and the original text behind each premise, checked word for word.
In a chapter of Powers and Prospects (1996), the linguist Noam Chomsky criticises a popular approach to artificial intelligence: the Turing test, which tries to decide whether an object "manifests intelligence". For him, whether a computer plays chess, understands Chinese or thinks is like whether robots can murder or airplanes can fly: a matter of decision, not of fact. A submarine mistaken for a whale does not show that it swims, nor that it does not. Chomsky argues that Turing himself understood this. A caveat: a spoken remark by Chomsky about Japanese (where a submarine would be said to swim) is sometimes cited; we have not found it in any verifiable text and do not use it.
click a premise to reject it
Without the implicit premise: Without P4, the computer finds a case where the word "think" is a matter of decision, but a real question of fact remains about what the machine experiences: the question is not empty after all.
Objections
3Each objection is a conversation: click to see who replies and where the debate stands.
Alan Turing 1950 · attacks the conclusionTuring does not merely set the question aside: he replaces it with another, "closely related and expressed in relatively unambiguous words", the imitation game. This new question is one of fact: can a program fool an interrogator as often as a man? The test would thus answer something precise.
Chomsky replies
Turing does not merely set the question aside: he replaces it with another, "closely related and expressed in relatively unambiguous words", the imitation game. This new question is one of fact: can a program fool an interrogator as often as a man? The test would thus answer something precise.
John Searle 1980 · attacks premise 4The question of understanding is not a question of words. A computer following a program manipulates symbols without knowing what they mean: it has syntax, not semantics. Whether a program suffices for understanding is, for Searle, "the right question to ask".
no reply
The question of understanding is not a question of words. A computer following a program manipulates symbols without knowing what they mean: it has syntax, not semantics. Whether a program suffices for understanding is, for Searle, "the right question to ask".
David Chalmers 1995 · attacks premise 4Even if we set aside the words "think" and "understand", a question remains that is not verbal: is there something it is like to be this machine? Chalmers speaks of "the really hard problem", that of experience.
no reply
Even if we set aside the words "think" and "understand", a question remains that is not verbal: is there something it is like to be this machine? Chalmers speaks of "the really hard problem", that of experience.