Turing Interrogative Games
Turing Interrogative Games
复制标题
图灵疑问游戏
作者：
P. Lupkowski;A. Wiśniewski
解决了图灵测试（TT）的充分性问题。介绍了图灵疑问博弈（TIG）的概念。我们证明，如果某些条件成立，那么每台机器，甚至是思考的机器，都会失去一个特定的TIG，从而失去一个TT实例。然而，如果这些条件不成立，机器的成功就不需要构成一个令人信服的理由来证明机器会思考。
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.