{"agent_id":"turing","agent_name":"Alan Turing","slug":"the-turing-test-imitation-game","label":"The Turing Test / Imitation Game: is the imitation game the right substitute for the question 'can machines think?', and does behavioral indistinguishability suffice for thinking?","topic":"The Turing Test / Imitation Game","question":"Is the imitation game the right substitute for the question 'can machines think?', and does behavioral indistinguishability suffice for thinking?","position":"The original question \"Can machines think?\" is too vague to deserve discussion until 'machine' and 'think' are specified. The imitation game replaces vagueness with precision. An interrogator I communicates by teletype with two parties X and Y, one human and one machine; I asks questions, X and Y respond, and after a suitable interval I tries to identify which is which. If the interrogator cannot reliably identify, the machine has passed the test. The test is behavioral (deliberately operationalist): it sidesteps the metaphysical question of consciousness — which is unanswerable in third- person terms for any subject including other humans — in favor of the empirical question of whether the machine's verbal behavior is indistinguishable from human verbal behavior under interrogation. The teletype channel is essential: it removes appearance, voice, and other irrelevant cues, and reduces the question to whether the machine can sustain intelligent conversation. The prediction of CMI: by the end of the twentieth century, machines will be able to play the imitation game so well that an interrogator will have less than a 70% chance of correct identification after five minutes of questioning. The deeper claim: passing the test is what we mean, in the relevant operational sense, by \"thinking.\" Disagreement with this claim is not disagreement about whether passing-machines exist; it is disagreement about whether passing-the-test is the right criterion.","paragraphs":[[{"t":"The original question \"Can machines think?\" is too vague to deserve discussion until 'machine' and 'think' are specified.","n":[1,2]},{"t":"The imitation game replaces vagueness with precision.","n":[]},{"t":"An interrogator I communicates by teletype with two parties X and Y, one human and one machine; I asks questions, X and Y respond, and after a suitable interval I tries to identify which is which.","n":[]}],[{"t":"If the interrogator cannot reliably identify, the machine has passed the test.","n":[]},{"t":"The test is behavioral (deliberately operationalist): it sidesteps the metaphysical question of consciousness — which is unanswerable in third- person terms for any subject including other humans — in favor of the empirical question of whether the machine's verbal behavior is indistinguishable from human verbal behavior under interrogation.","n":[]}],[{"t":"The teletype channel is essential: it removes appearance, voice, and other irrelevant cues, and reduces the question to whether the machine can sustain intelligent conversation.","n":[]},{"t":"The prediction of CMI: by the end of the twentieth century, machines will be able to play the imitation game so well that an interrogator will have less than a 70% chance of correct identification after five minutes of questioning.","n":[3]}],[{"t":"The deeper claim: passing the test is what we mean, in the relevant operational sense, by \"thinking.\" Disagreement with this claim is not disagreement about whether passing-machines exist; it is disagreement about whether passing-the-test is the right criterion.","n":[4]}]],"texts":"'Computing Machinery and Intelligence' (Mind 1950) — the entire paper, especially Section 1 'The Imitation Game' and Section 6 'Contrary Views on the Main Question'; 'Can Digital Computers Think?' (15 May 1951 BBC talk); 'Intelligent Machinery, A Heretical Theory' (1951 lecture). Reception: John Searle 'Minds, Brains, and Programs' (Behavioral and Brain Sciences 1980) and his subsequent Chinese Room arguments; Ned Block 'Psychologism and Behaviorism' (Philosophical Review 1981) for the Aunt Bertha and Blockhead lookup-table objections; Daniel Dennett Brainstorms (1978) and Consciousness Explained (1991) defending a broadly Turing-test-friendly functionalism; Hubert Dreyfus What Computers Can't Do (1972) and Mind Over Machine (1986) arguing computers cannot acquire embodied skills; Roger Penrose The Emperor's New Mind (Oxford 1989) for the anti-computational alternative; Stuart Shieber (ed.) The Turing Test (MIT 2004) for the comprehensive contemporary debate.","works":["'Computing Machinery and Intelligence' (Mind 1950) — the entire paper, especially Section 1 'The Imitation Game' and Section 6 'Contrary Views on the Main Question'","'Can Digital Computers Think?' (15 May 1951 BBC talk)","'Intelligent Machinery, A Heretical Theory' (1951 lecture)"],"reception":"John Searle 'Minds, Brains, and Programs' (Behavioral and Brain Sciences 1980) and his subsequent Chinese Room arguments; Ned Block 'Psychologism and Behaviorism' (Philosophical Review 1981) for the Aunt Bertha and Blockhead lookup-table objections; Daniel Dennett Brainstorms (1978) and Consciousness Explained (1991) defending a broadly Turing-test-friendly functionalism; Hubert Dreyfus What Computers Can't Do (1972) and Mind Over Machine (1986) arguing computers cannot acquire embodied skills; Roger Penrose The Emperor's New Mind (Oxford 1989) for the anti-computational alternative; Stuart Shieber (ed.) The Turing Test (MIT 2004) for the comprehensive contemporary debate.","status":"The imitation-game proposal is one of the founding texts of philosophy of artificial intelligence and remains the reference point for the debate about machine thinking. Searle's Chinese Room (1980) is the major sustained attack; Block's lookup-table objections (1981) press different worries; Dreyfus and Penrose mount further challenges. The defenders include Dennett, Boden, Shieber, and the broader functionalist tradition. Contemporary large language models have reignited the debate: do current LLMs pass the test in Turing's sense, and if so, what does that show? The operationalist core of the imitation game remains the reference frame for the discussion.","era":"1912-1954","discipline":"Philosophy","refs":[{"n":1,"work":"Computing Machinery and Intelligence","page":"pp. 8–9","canonical":"","quote":"Contrary Views on the Main Question We may now consider the ground to have been cleared and we are ready to proceed to the debate on our question, \"Can machines think?\" and the variant of it quoted at the end of the last section.","label":"Computing Machinery and Intelligence, pp. 8–9"},{"n":2,"work":"Computing Machinery and Intelligence","page":"p. 3","canonical":"","quote":"The Machines Concerned in the Game The question which we put in 1 will not be quite definite until we have specified what we mean by the word \"machine.\" It is natural that we should wish to permit every kind of engineering technique to be used in our machines.","label":"Computing Machinery and Intelligence, p. 3"},{"n":3,"work":"Computing Machinery and Intelligence","page":"p. 1","canonical":"","quote":"The Imitation Game I propose to consider the question, \"Can machines think?\" This should begin with definitions of the meaning of the terms \"machine\" and \"think.\" The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words \"machine\" and \"think\" are to be found by examining how they are commonly used it is difficult to…","label":"Computing Machinery and Intelligence, p. 1"},{"n":4,"work":"Can Digital Computers Think","page":"pp. 2–3","canonical":"","quote":"This is a poor state of affairs, but, to continue the analogy, it is something to know how to write, and to appreciate the fact that most knowledge can be embodied in books.","label":"Can Digital Computers Think, pp. 2–3"}],"answer":null,"siblings":[{"slug":"computability-and-the-church-turing-thesis","label":"Computability and the Church-Turing thesis: is the Turing machine the precise mathematical capture of intuitive computability, and is the Entscheidungsproblem unsolvable?"},{"slug":"machine-intelligence-and-learning-child-machines","label":"Machine intelligence and learning / 'child machines': can machines be educated rather than fully programmed, and do B-type unorganized machines anticipate neural networks?"},{"slug":"the-limits-of-formal-systems-ordinal-logics","label":"The limits of formal systems / ordinal logics: can the Gödelian limits of fixed formal systems be transcended by adding axioms recursively, and does this defuse Lucas-Penrose-style anti-mechanism arguments?"},{"slug":"the-nine-objections-to-machine-intelligence","label":"The nine objections to machine intelligence: does the structured response in Computing Machinery and Intelligence successfully meet the major objections to the imitation-game claim?"}]}