Minds and Machines 14 (2):133-43 (2004)
This paper considers undecidability in the imitation game, the so-called Turing Test. In the Turing Test, a human, a machine, and an interrogator are the players of the game. In our model of the Turing Test, the machine and the interrogator are formalized as Turing machines, allowing us to derive several impossibility results concerning the capabilities of the interrogator. The key issue is that the validity of the Turing test is not attributed to the capability of human or machine, but rather to the capability of the interrogator. In particular, it is shown that no Turing machine can be a perfect interrogator. We also discuss meta-imitation game and imitation game with analog interfaces where both the imitator and the interrogator are mimicked by continuous dynamical systems
|Keywords||Game Imitation Logic Turing Machines Undecidability|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Turing Interrogative Games.Paweł Łupkowski & Andrzej Wiśniewski - 2011 - Minds and Machines 21 (3):435-448.
Similar books and articles
Imitation Versus Communication: Testing for Human-Like Intelligence.Jamie Cullen - 2009 - Minds and Machines 19 (2):237-254.
Intelligence is Not Enough: On the Socialization of Talking Machines. [REVIEW]E. Ronald & Moshe Sipper - 2001 - Minds and Machines 11 (4):567-576.
Testing Turing's Parallel-Paired Imitation Game.Huma Shah & Kevin Warwick - 2010 - Kybernetes 39 (3).
Making the Right Identification in the Turing Test.Saul Traiger - 2000 - Minds and Machines 10 (4):561-572.
Added to index2009-01-28
Total downloads69 ( #71,805 of 2,133,062 )
Recent downloads (6 months)1 ( #384,179 of 2,133,062 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.