Turing Interrogative Games

dc.contributor.authorŁupkowski, Paweł
dc.contributor.authorWiśniewski, Andrzej
dc.date.accessioned2011-05-16T10:36:37Z
dc.date.available2011-05-16T10:36:37Z
dc.date.issued2011
dc.descriptionReceived: 18 November 2010 / Accepted: 9 March 2011 (c) The Author(s) 2011. This article is published with open access at Springerlink.compl_PL
dc.description.abstractThe 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.citationMinds and Machines, Doi: 10.1007/s11023-011-9245-zpl_PL
dc.identifier.issn0924-6495
dc.identifier.urihttp://hdl.handle.net/10593/1021
dc.language.isoenpl_PL
dc.publisherSpringer Netherlandspl_PL
dc.subjectTuring testpl_PL
dc.subjectLogic of questionspl_PL
dc.subjectInterrogative gamespl_PL
dc.subjectRecursion theorypl_PL
dc.titleTuring Interrogative Gamespl_PL
dc.typeArtykułpl_PL

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
tig.pdf
Size:
279.72 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.6 KB
Format:
Item-specific license agreed upon to submission
Description: