David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Noûs 41 (4):686–713 (2007)
In 1950, Alan Turing proposed his eponymous test based on indistinguishability of verbal behavior as a replacement for the question "Can machines think?" Since then, two mutually contradictory but well-founded attitudes towards the Turing Test have arisen in the philosophical literature. On the one hand is the attitude that has become philosophical conventional wisdom, viz., that the Turing Test is hopelessly flawed as a sufficient condition for intelligence, while on the other hand is the overwhelming sense that were a machine to pass a real live full-fledged Turing Test, it would be a sign of nothing but our orneriness to deny it the attribution of intelligence. The arguments against the sufficiency of the Turing Test for determining intelligence rely on showing that some extra conditions are logically necessary for intelligence beyond the behavioral properties exhibited by an agent under a Turing Test. Therefore, it cannot follow logically from passing a Turing Test that the agent is intelligent. I argue that these extra conditions can be revealed by the Turing Test, so long as we allow a very slight weakening of the criterion from one of logical proof to one of statistical proof under weak realizability assumptions. The argument depends on the notion of interactive proof developed in theoretical computer science, along with some simple physical facts that constrain the information capacity of agents. Crucially, the weakening is so slight as to make no conceivable difference from a practical standpoint. Thus, the Gordian knot between the two opposing views of the sufficiency of the Turing Test can be cut
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
John R. Searle (1980). Minds, Brains and Programs. Behavioral and Brain Sciences 3 (3):417-57.
Alan M. Turing (1950). Computing Machinery and Intelligence. Mind 59 (October):433-60.
Ned Block (1981). Psychologism and Behaviorism. Philosophical Review 90 (1):5-43.
Robert M. French (1990). Subcognition and the Limits of the Turing Test. Mind 99 (393):53-66.
Citations of this work BETA
Darren Abramson (2011). Descartes' Influence on Turing. Studies in History and Philosophy of Science Part A 42 (4):544-551.
Paul Schweizer (2012). The Externalist Foundations of a Truly Total Turing Test. Minds and Machines 22 (3):191-212.
Paweł Łupkowski & Andrzej Wiśniewski (2011). Turing Interrogative Games. Minds and Machines 21 (3):435-448.
Similar books and articles
A. P. Saygin & I. Cicekli (2000). Turing Test: 50 Years Later. [REVIEW] Minds and Machines 10 (4):463-518.
Benny Shanon (1989). A Simple Comment Regarding the Turing Test. Journal for the Theory of Social Behaviour 19 (June):249-56.
Ayse Pinar Saygin, Ilyas Cicekli & Varol Akman (2000). Turing Test: 50 Years Later. [REVIEW] Minds and Machines 10 (4):463-518.
Saul Traiger (2000). Making the Right Identification in the Turing Test. Minds and Machines 10 (4):561-572.
Tyler Cowen & Michelle Dawson, What Does the Turing Test Really Mean? And How Many Human Beings (Including Turing) Could Pass?
James H. Moor (2001). The Status and Future of the Turing Test. Minds and Machines 11 (1):77-93.
Justin Leiber (1995). On Turing's Turing Test and Why the Matter Matters. Synthese 104 (1):59-69.
B. Jack Copeland (2000). The Turing Test. Minds and Machines 10 (4):519-539.
Susan G. Sterrett (2000). Turing's Two Tests for Intelligence. Minds and Machines 10 (4):541-559.
Dale Jacquette (1993). Who's Afraid of the Turing Test? Behavior and Philosophy 20 (21):63-74.
Added to index2009-01-28
Total downloads15 ( #241,221 of 1,906,979 )
Recent downloads (6 months)3 ( #277,342 of 1,906,979 )
How can I increase my downloads?