Minds and Machines

, Volume 14, Issue 2, pp 133–143

Undecidability in the Imitation Game

  • Yuzuru Sato
  • Takashi Ikegami

DOI: 10.1023/B:MIND.0000021747.28850.16

Cite this article as:
Sato, Y. & Ikegami, T. Minds and Machines (2004) 14: 133. doi:10.1023/B:MIND.0000021747.28850.16


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.

analog computationdynamical systemsimitation gameTuring machineundecidability

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Yuzuru Sato
    • 1
  • Takashi Ikegami
    • 2
  1. 1.Brain Science InstituteInstitute of Physical and Chemical Research (RIKEN)Wako, SaitamaJapan
  2. 2.Graduate School of Arts and ScienceUniversity of TokyoMeguro-ku, TokyoJapan