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. © 2011 Springer Science+Business Media B.V.
CITATION STYLE
Łupkowski, P., & Wiśniewski, A. (2011). Turing interrogative games. Minds and Machines, 21(3), 435–448. https://doi.org/10.1007/s11023-011-9245-z
Mendeley helps you to discover research relevant for your work.