Minds and Machines

, Volume 14, Issue 2, pp 133-143

First online:

Undecidability in the Imitation Game

  • Yuzuru SatoAffiliated withBrain Science Institute, Institute of Physical and Chemical Research (RIKEN)
  • , Takashi IkegamiAffiliated withGraduate School of Arts and Science, University of Tokyo

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 computation dynamical systems imitation game Turing machine undecidability