, Volume 21, Issue 3, pp 435-448,
Open Access This content is freely available online to anyone, anywhere at any time.
Date: 24 Mar 2011

Turing Interrogative Games

Abstract

The issue of adequacy of the Turing Test (TT) is addressed. The concept of Turing Interrogative Game (TIG) is introduced. We show that if some conditions hold, then each machine, even a thinking one, loses a certain TIG and thus an instance of TT. If, however, the conditions do not hold, the success of a machine need not constitute a convincing argument for the claim that the machine thinks.