du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The April Fool Turing Test
Dalarna University, School of Technology and Business Studies, Computer Engineering.
Dalarna University, School of Technology and Business Studies, Computer Engineering.
Dalarna University, School of Technology and Business Studies, Computer Engineering.ORCID iD: 0000-0003-0403-338X
2006 (English)In: tripleC (cognition, communication, co-operation): Journal for a Global Sustainable Information Society / Unified Theory of Information Research Group, ISSN 1726-670X, E-ISSN 1726-670X, Vol. 4, no 2Article in journal (Refereed) Published
Abstract [en]

This paper explores certain issues concerning the Turing test; non-termination, asymmetry and the need for a control experiment. A standard diagonalisation argument to show the non-computability of AI is extended to yields a socalled “April fool Turing test”, which bears some relationship to Wizard of Oz experiments and involves placing several experimental participants in a symmetrical paradox – the “April Fool Turing Test”. The fundamental question which is asked is whether escaping from this paradox is a sign of intelligence. An important ethical consideration with such an experiment is that in order to place humans in such a paradox it is necessary to fool them. Results from an actual April Fool Turing Test experiment are reported. It is concluded that the results clearly illustrate some of the difficulties and paradoxes which surround the classical Turing Test.

Place, publisher, year, edition, pages
2006. Vol. 4, no 2
Keywords [en]
Turing Test, AI, Gödel’s Incompleteness Theorem, Diagonalisation, Symmetrical Paradox
Identifiers
URN: urn:nbn:se:du-1935OAI: oai:dalea.du.se:1935DiVA, id: diva2:519647
Available from: 2006-03-11 Created: 2006-03-11 Last updated: 2017-12-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Westin, Jerker

Search in DiVA

By author/editor
Dougherty, MarkDougherty, Sofi HWestin, Jerker
By organisation
Computer Engineering
In the same journal
tripleC (cognition, communication, co-operation): Journal for a Global Sustainable Information Society / Unified Theory of Information Research Group

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 672 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf