Turing Interrogative Games
dc.contributor.author | Łupkowski, Paweł | |
dc.contributor.author | Wiśniewski, Andrzej | |
dc.date.accessioned | 2011-05-16T10:36:37Z | |
dc.date.available | 2011-05-16T10:36:37Z | |
dc.date.issued | 2011 | |
dc.description | Received: 18 November 2010 / Accepted: 9 March 2011 (c) The Author(s) 2011. This article is published with open access at Springerlink.com | pl_PL |
dc.description.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. | pl_PL |
dc.identifier.citation | Minds and Machines, Doi: 10.1007/s11023-011-9245-z | pl_PL |
dc.identifier.issn | 0924-6495 | |
dc.identifier.uri | http://hdl.handle.net/10593/1021 | |
dc.language.iso | en | pl_PL |
dc.publisher | Springer Netherlands | pl_PL |
dc.subject | Turing test | pl_PL |
dc.subject | Logic of questions | pl_PL |
dc.subject | Interrogative games | pl_PL |
dc.subject | Recursion theory | pl_PL |
dc.title | Turing Interrogative Games | pl_PL |
dc.type | Artykuł | pl_PL |