Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- A. P. Saygin & I. Cicekli (2000). Turing Test: 50 Years Later. Minds and Machines 10 (4):463-518.The Turing Test is one of the most disputed topics in artificial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philo- sophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing’s ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the ‘other minds’ problem, and similar topics in philosophy of mind are discussed. We also cover the sociological and psychological aspects of the Turing Test. Finally, we look at the current situation and analyze programs that have been developed with the aim of passing the Turing Test. We conclude that the Turing Test has been, and will continue to be, an influential and controversial topic.In my reading list | Discuss this article | Edit | Categorize |My bibliography
| Export citation | Other links: cogprints.org citeseer.ist.psu.edu crl.ucsd.edu portal.acm.org cogprints.ecs.soton.ac.uk cs.bilkent.edu.tr citebase.eprints.org kluweronline.com springerlink.com | Scholar
Discussion of A. P. Saygin & I. Cicekli, Turing test: 50 years later
Nothing in this forum yet.
Similar books and articles
The Turing Test is one of the most disputed topics in artificial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philosophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing''s ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the `other minds'' problem, and similar topics in philosophy of mind are discussed. We (...)
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: cogprints.org citeseer.ist.psu.edu crl.ucsd.edu portal.acm.org cogprints.ecs.soton.ac.uk cs.bilkent.edu.tr citebase.eprints.org springerlink.com kluweronline.com | Scholar | More..
| | Other links: cogprints.org citeseer.ist.psu.edu crl.ucsd.edu portal.acm.org cogprints.ecs.soton.ac.uk cs.bilkent.edu.tr citebase.eprints.org springerlink.com kluweronline.com | Scholar | More.. Turing''s test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: books.google.com springerlink.com kluweronline.com ingentaconnect.com | Scholar | More..
| | Other links: books.google.com springerlink.com kluweronline.com ingentaconnect.com | Scholar | More.. This commentary attempts to show that the inverted Turing Test (Watt 1996) could be simulated by a standard Turing test and, most importantly, claims that a very simple program with no intelligence whatsoever could be written that would pass the inverted Turing test. For this reason, the inverted Turing test in its present form must be rejected.
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: u-bourgogne.fr | Scholar | More..
| | Other links: u-bourgogne.fr | Scholar | More.. The test Turing proposed for machine intelligence is usually understood to be a test of whether a computer can fool a human into thinking that the computer is a human. This standard interpretation is rejected in favor of a test based on the Imitation Game introduced by Turing at the beginning of "Computing Machinery and Intelligence.".
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: traiger.oxy.edu faculty.oxy.edu 0-www.faculty.oxy.edu.oasys.lib.oxy.edu books.google.com springerlink.com ingentaconnect.com | Scholar | More..
| | Other links: traiger.oxy.edu faculty.oxy.edu 0-www.faculty.oxy.edu.oasys.lib.oxy.edu books.google.com springerlink.com ingentaconnect.com | Scholar | More.. In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: philosophy.wisc.edu links.jstor.org jstor.org | Scholar | More..
| | Other links: philosophy.wisc.edu links.jstor.org jstor.org | Scholar | More.. The standard interpretation of the imitation game is defended over the rival gender interpretation though it is noted that Turing himself proposed several variations of his imitation game. The Turing test is then justified as an inductive test not as an operational definition as commonly suggested. Turing's famous prediction about his test being passed at the 70% level is disconfirmed by the results of the Loebner 2000 contest and the absence of any serious Turing test competitors from AI on the (...)
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: books.google.com springerlink.com kluweronline.com ingentaconnect.com | Scholar | More..
| | Other links: books.google.com springerlink.com kluweronline.com ingentaconnect.com | Scholar | More.. The so-called Turing test, as it is usually interpreted, sets a benchmark standard for determining when we might call a machine intelligent. We can call a machine intelligent if the following is satisfied: if a group of wise observers were conversing with a machine through an exchange of typed messages, those observers could not tell whether they were talking to a human being or to a machine. To pass the test, the machine has to be intelligent but it also should (...)
A. M. Turing has bequeathed us a conceptulary including 'Turing, or Turing-Church, thesis', 'Turing machine', 'universal Turing machine', 'Turing test' and 'Turing structures', plus other unnamed achievements. These include a proof that any formal language adequate to express arithmetic contains undecidable formulas, as well as achievements in computer science, artificial intelligence, mathematics, biology, and cognitive science. Here it is argued that these achievements hang together and have prospered well in the 50 years since Turing's death.
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: informaworld.com taylorandfrancis.metapress.com ingentaconnect.com | Scholar | More..
| | Other links: informaworld.com taylorandfrancis.metapress.com ingentaconnect.com | Scholar | More.. No computer that had not experienced the world as we humans had could pass a rigorously administered standard Turing Test. We show that the use of “subcognitive” questions allows the standard Turing Test to indirectly probe the human subcognitive associative concept network built up over a lifetime of experience with the world. Not only can this probing reveal differences in cognitive abilities, but crucially, even differences in _physical aspects_ of the candidates can be detected. Consequently, it is unnecessary to propose (...)
In my reading list
| Discuss this article | Edit | Categorize | My bibliography | Export citation | Other links: citeseer.ist.psu.edu u-bourgogne.fr informaworld.com ingentaconnect.com | Scholar | More..
| | Other links: citeseer.ist.psu.edu u-bourgogne.fr informaworld.com ingentaconnect.com | Scholar | More.. 
