Huang X, McCalla GI, Greer JE, Neufeld E (1991) Revising deductive knowledge and stereotypical knowledge in a student model. Harkaway N (2018) Will computers be able to think? Five books to help us understand AI. Gärdenfors P (1992) Belief revision: Cambridge tracts in theoretical computer science. Artif Intell 28(2):127–162ĭennett DC (2012) Turing’s gradualist vision: making minds from proto-minds Turing in context II, Brussels Invited talk Accessed ĭe Kleer J (1986) An assumption-based TMS. Springer, Netherlands, pp 119–138ĭavis E, Morgenstern L, Ortiz C (2019) The Winograd schema challenge. In: Epstein R, Roberts G, Beber G (eds) Parsing the Turing test: philosophical and methodological issues in the quest for the thinking computer. Accessed Ĭopeland J, Proudfoot D (2008) Turing’s test: a philosophical and historical guide. MIT Press, CambridgeĬommonsense reasoning (2019) Winograd schema challenge. J Symb Log 50:510–530īacchus F (1990) Representing and reasoning with probabilistic knowledge: a logical approach to probabilities. Accessed Īlchourrón CE, Gärdenfors P, Makinson D (1985) On the logic of theory change: partial meet contraction and revision functions. 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.Īaronson S (2014) My conversation with “Eugene Goostman,” the chatbot that’s all over the news for allegedly passing the Turing test. 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 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. 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. 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.
0 Comments
Leave a Reply. |