In defense of the Turing test

被引:7
作者
Neufeld, Eric [1 ]
Finnestad, Sonje [1 ]
机构
[1] Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK, Canada
关键词
Turing test; Winograd schema; Practical certainty; Collaborative conversation;
D O I
10.1007/s00146-020-00946-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In 2014, widespread reports in the popular media that a chatbot named Eugene Goostman had passed the Turing test became further grist for those who argue that the diversionary tactics of chatbots like Goostman and others, such as those who participate in the Loebner competition, are enabled by the open-ended dialog of the Turing test. Some claim a new kind of test of machine intelligence is needed, and one community has advanced the Winograd schema competition to address this gap. We argue to the contrary that implicit in the Turing test is the cooperative challenge of using language to build a practical working understanding, necessitating a human interrogator to monitor and direct the conversation. We give examples which show that, because ambiguity in language is ubiquitous, open-ended conversation is not a flaw but rather the core challenge of the Turing test. We outline a statistical notion of practical working understanding that permits a reasonable amount of ambiguity, but nevertheless requires that ambiguity be resolved sufficiently for the agents to make progress.
引用
收藏
页码:819 / 827
页数:9
相关论文
共 32 条
  • [1] Aaronson S, 2014, MY CONVERSATION EUGE
  • [2] ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS
    ALCHOURRON, CE
    GARDENFORS, P
    MAKINSON, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) : 510 - 530
  • [3] [Anonymous], 2014, The New Yorker
  • [4] [Anonymous], 1990, REPRESENTING REASONI
  • [5] [Anonymous], 2004, The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life: Plus The Secrets of Enigma
  • [6] Commonsense reasoning, 2019, WIN SCHEM CHALL
  • [7] Copeland Jack., 2008, PARSING TURING TEST, P119
  • [8] Davis E, 2019, WINOGRAD SCHEMA CHAL
  • [9] AN ASSUMPTION-BASED TMS
    DEKLEER, J
    [J]. ARTIFICIAL INTELLIGENCE, 1986, 28 (02) : 127 - 162
  • [10] Dennett DC, 2012, TURINGS GRADUALIST V, VII