Mind 59 (October):433-60 (1950)
Abstract |
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 escape the conclusion that the meaning and the answer to the question, "Can machines think?" is to be sought in a statistical survey such as a Gallup poll. But this is absurd. Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words. The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B. We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?".
|
Keywords | Behavior Computer Extrasensory Perception Game Imitation Intelligence Learning Machine Physiology Science Thinking |
Categories | (categorize this paper) |
DOI | 10.1093/mind/LIX.236.433 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
General Recursive Functions of Natural Numbers.S. C. Kleene - 1937 - Journal of Symbolic Logic 2 (1):38-38.
Citations of this work BETA
Welcoming Robots Into the Moral Circle: A Defence of Ethical Behaviourism.John Danaher - 2020 - Science and Engineering Ethics 26 (4):2023-2049.
A United Framework of Five Principles for AI in Society.Luciano Floridi & Josh Cowls - 2019 - Harvard Data Science Review 1 (1).
Book: Cognitive Design for Artificial Minds.Antonio Lieto - 2021 - London, UK: Routledge, Taylor & Francis Ltd.
Some Philosophical Problems From the Standpoint of Artificial Intelligence.John McCarthy & Patrick Hayes - 1969 - In B. Meltzer & Donald Michie (eds.), Machine Intelligence 4. Edinburgh University Press. pp. 463--502.
View all 805 citations / Add more citations
Similar books and articles
Turing's Rules for the Imitation Game.Gualtiero Piccinini - 2000 - Minds and Machines 10 (4):573-582.
Intelligence is Not Enough: On the Socialization of Talking Machines. [REVIEW]E. Ronald & Moshe Sipper - 2001 - Minds and Machines 11 (4):567-576.
Making the Right Identification in the Turing Test.Saul Traiger - 2000 - Minds and Machines 10 (4):561-572.
Testing Turing's Parallel-Paired Imitation Game.Huma Shah & Kevin Warwick - 2010 - Kybernetes 39 (3).
Undecidability in the Imitation Game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Analytics
Added to PP index
2009-01-28
Total views
2,852 ( #1,308 of 2,499,691 )
Recent downloads (6 months)
231 ( #2,263 of 2,499,691 )
2009-01-28
Total views
2,852 ( #1,308 of 2,499,691 )
Recent downloads (6 months)
231 ( #2,263 of 2,499,691 )
How can I increase my downloads?
Downloads