CINXE.COM

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>Turing test - Wikipedia</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )enwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy", "wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"8ab2c473-ba88-43f8-9c3a-e2782d573f46","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Turing_test","wgTitle":"Turing test","wgCurRevisionId":1257901311,"wgRevisionId":1257901311,"wgArticleId":21391751,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Webarchive template wayback links","Wikipedia articles needing clarification from January 2021","Wikipedia articles needing page number citations from May 2011","All articles with dead external links","Articles with dead external links from September 2023","Articles with permanently dead external links","Articles with dead external links from July 2018","Articles with short description","Short description is different from Wikidata","Use British English from February 2024", "Use dmy dates from June 2014","All articles with unsourced statements","Articles with unsourced statements from November 2024","Commons category link from Wikidata","1950 in computing","Alan Turing","Computer-related introductions in 1950","History of artificial intelligence","Human–computer interaction","Philosophy of artificial intelligence","Turing tests"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"Turing_test","wgRelevantArticleId":21391751,"wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia","wgCiteReferencePreviewsActive":false,"wgFlaggedRevsParams":{"tags":{"status":{"levels":1}}},"wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"en","pageLanguageDir":"ltr","pageVariantFallbacks":"en"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true, "tagline":false,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":100000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q189223","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={"ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.cite.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready", "jquery.makeCollapsible.styles":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.cite.ux-enhancements","mediawiki.page.media","ext.scribunto.logs","site","mediawiki.page.ready","jquery.makeCollapsible","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.switcher","ext.urlShortener.toolbar","ext.centralauth.centralautologin","mmv.bootstrap","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface","ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.quicksurveys.init","ext.growthExperiments.SuggestedEditSession","wikibase.sidebar.tracking" ];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.cite.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cjquery.makeCollapsible.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/5/55/Turing_test_diagram.png"> <meta property="og:image:width" content="1200"> <meta property="og:image:height" content="915"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/5/55/Turing_test_diagram.png"> <meta property="og:image:width" content="800"> <meta property="og:image:height" content="610"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/5/55/Turing_test_diagram.png/640px-Turing_test_diagram.png"> <meta property="og:image:width" content="640"> <meta property="og:image:height" content="488"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="Turing test - Wikipedia"> <meta property="og:type" content="website"> <link rel="preconnect" href="//upload.wikimedia.org"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wikipedia.org/wiki/Turing_test"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=Turing_test&action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (en)"> <link rel="EditURI" type="application/rsd+xml" href="//en.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://en.wikipedia.org/wiki/Turing_test"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en"> <link rel="alternate" type="application/atom+xml" title="Wikipedia Atom feed" href="/w/index.php?title=Special:RecentChanges&feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-Turing_test rootpage-Turing_test skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Main menu </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigation </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-description" class="mw-list-item"><a href="/wiki/Main_Page" title="Visit the main page [z]" accesskey="z">Main page</a></li><li id="n-contents" class="mw-list-item"><a href="/wiki/Wikipedia:Contents" title="Guides to browsing Wikipedia">Contents</a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Current_events" title="Articles related to current events">Current events</a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Visit a randomly selected article [x]" accesskey="x">Random article</a></li><li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:About" title="Learn about Wikipedia and how it works">About Wikipedia</a></li><li id="n-contactpage" class="mw-list-item"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us" title="How to contact Wikipedia">Contact us</a></li> </ul> </div> </div> <div id="p-interaction" class="vector-menu mw-portlet mw-portlet-interaction" > <div class="vector-menu-heading"> Contribute </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-help" class="mw-list-item"><a href="/wiki/Help:Contents" title="Guidance on how to use and edit Wikipedia">Help</a></li><li id="n-introduction" class="mw-list-item"><a href="/wiki/Help:Introduction" title="Learn how to edit Wikipedia">Learn to edit</a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:Community_portal" title="The hub for editors">Community portal</a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:RecentChanges" title="A list of recent changes to Wikipedia [r]" accesskey="r">Recent changes</a></li><li id="n-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_upload_wizard" title="Add images or other media for use on Wikipedia">Upload file</a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Main_Page" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <img class="mw-logo-wordmark" alt="Wikipedia" src="/static/images/mobile/copyright/wikipedia-wordmark-en.svg" style="width: 7.5em; height: 1.125em;"> <img class="mw-logo-tagline" alt="The Free Encyclopedia" src="/static/images/mobile/copyright/wikipedia-tagline-en.svg" width="117" height="13" style="width: 7.3125em; height: 0.8125em;"> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Wikipedia [f]" accesskey="f"> Search </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Wikipedia" aria-label="Search Wikipedia" autocapitalize="sentences" title="Search Wikipedia [f]" accesskey="f" id="searchInput" > </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Appearance </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&uselang=en" class="">Donate</a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:CreateAccount&returnto=Turing+test" title="You are encouraged to create an account and log in; however, it is not mandatory" class="">Create account</a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:UserLogin&returnto=Turing+test" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o" class="">Log in</a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="Log in and more options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Personal tools </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&uselang=en">Donate</a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=Turing+test" title="You are encouraged to create an account and log in; however, it is not mandatory"> Create account</a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=Turing+test" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o"> Log in</a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing">learn more</a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y">Contributions</a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n">Talk</a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">(Top)</div> </a> </li> <li id="toc-Chatbots" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Chatbots"> <div class="vector-toc-text"> 1 Chatbots </div> </a> <button aria-controls="toc-Chatbots-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Chatbots subsection </button> <ul id="toc-Chatbots-sublist" class="vector-toc-list"> <li id="toc-ELIZA_and_PARRY" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#ELIZA_and_PARRY"> <div class="vector-toc-text"> 1.1 ELIZA and PARRY </div> </a> <ul id="toc-ELIZA_and_PARRY-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Eugene_Goostman" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Eugene_Goostman"> <div class="vector-toc-text"> 1.2 Eugene Goostman </div> </a> <ul id="toc-Eugene_Goostman-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Google_LaMDA" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Google_LaMDA"> <div class="vector-toc-text"> 1.3 Google LaMDA </div> </a> <ul id="toc-Google_LaMDA-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-ChatGPT" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#ChatGPT"> <div class="vector-toc-text"> 1.4 ChatGPT </div> </a> <ul id="toc-ChatGPT-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Virtual_assistants" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Virtual_assistants"> <div class="vector-toc-text"> 1.5 Virtual assistants </div> </a> <ul id="toc-Virtual_assistants-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Malware" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Malware"> <div class="vector-toc-text"> 1.6 Malware </div> </a> <ul id="toc-Malware-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-History" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#History"> <div class="vector-toc-text"> 2 History </div> </a> <button aria-controls="toc-History-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle History subsection </button> <ul id="toc-History-sublist" class="vector-toc-list"> <li id="toc-Philosophical_background" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Philosophical_background"> <div class="vector-toc-text"> 2.1 Philosophical background </div> </a> <ul id="toc-Philosophical_background-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Cultural_background" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Cultural_background"> <div class="vector-toc-text"> 2.2 Cultural background </div> </a> <ul id="toc-Cultural_background-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Alan_Turing_and_the_Imitation_Game" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Alan_Turing_and_the_Imitation_Game"> <div class="vector-toc-text"> 2.3 Alan Turing and the Imitation Game </div> </a> <ul id="toc-Alan_Turing_and_the_Imitation_Game-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-The_Chinese_room" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#The_Chinese_room"> <div class="vector-toc-text"> 2.4 The Chinese room </div> </a> <ul id="toc-The_Chinese_room-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Loebner_Prize" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Loebner_Prize"> <div class="vector-toc-text"> 2.5 Loebner Prize </div> </a> <ul id="toc-Loebner_Prize-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-CAPTCHA" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#CAPTCHA"> <div class="vector-toc-text"> 2.6 CAPTCHA </div> </a> <ul id="toc-CAPTCHA-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Versions" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Versions"> <div class="vector-toc-text"> 3 Versions </div> </a> <ul id="toc-Versions-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Interpretations" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Interpretations"> <div class="vector-toc-text"> 4 Interpretations </div> </a> <button aria-controls="toc-Interpretations-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Interpretations subsection </button> <ul id="toc-Interpretations-sublist" class="vector-toc-list"> <li id="toc-Should_the_interrogator_know_about_the_computer?" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Should_the_interrogator_know_about_the_computer?"> <div class="vector-toc-text"> 4.1 Should the interrogator know about the computer? </div> </a> <ul id="toc-Should_the_interrogator_know_about_the_computer?-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Strengths" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Strengths"> <div class="vector-toc-text"> 5 Strengths </div> </a> <button aria-controls="toc-Strengths-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Strengths subsection </button> <ul id="toc-Strengths-sublist" class="vector-toc-list"> <li id="toc-Tractability_and_simplicity" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Tractability_and_simplicity"> <div class="vector-toc-text"> 5.1 Tractability and simplicity </div> </a> <ul id="toc-Tractability_and_simplicity-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Breadth_of_subject_matter" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Breadth_of_subject_matter"> <div class="vector-toc-text"> 5.2 Breadth of subject matter </div> </a> <ul id="toc-Breadth_of_subject_matter-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Emphasis_on_emotional_and_aesthetic_intelligence" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Emphasis_on_emotional_and_aesthetic_intelligence"> <div class="vector-toc-text"> 5.3 Emphasis on emotional and aesthetic intelligence </div> </a> <ul id="toc-Emphasis_on_emotional_and_aesthetic_intelligence-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Weaknesses" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Weaknesses"> <div class="vector-toc-text"> 6 Weaknesses </div> </a> <button aria-controls="toc-Weaknesses-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Weaknesses subsection </button> <ul id="toc-Weaknesses-sublist" class="vector-toc-list"> <li id="toc-Naïveté_of_interrogators" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Naïveté_of_interrogators"> <div class="vector-toc-text"> 6.1 Naïveté of interrogators </div> </a> <ul id="toc-Naïveté_of_interrogators-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Human_intelligence_vs._intelligence_in_general" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Human_intelligence_vs._intelligence_in_general"> <div class="vector-toc-text"> 6.2 Human intelligence vs. intelligence in general </div> </a> <ul id="toc-Human_intelligence_vs._intelligence_in_general-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Consciousness_vs._the_simulation_of_consciousness" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Consciousness_vs._the_simulation_of_consciousness"> <div class="vector-toc-text"> 6.3 Consciousness vs. the simulation of consciousness </div> </a> <ul id="toc-Consciousness_vs._the_simulation_of_consciousness-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Impracticality_and_irrelevance:_the_Turing_test_and_AI_research" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Impracticality_and_irrelevance:_the_Turing_test_and_AI_research"> <div class="vector-toc-text"> 6.4 Impracticality and irrelevance: the Turing test and AI research </div> </a> <ul id="toc-Impracticality_and_irrelevance:_the_Turing_test_and_AI_research-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-The_language-centric_objection" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#The_language-centric_objection"> <div class="vector-toc-text"> 6.5 The language-centric objection </div> </a> <ul id="toc-The_language-centric_objection-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Silence" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Silence"> <div class="vector-toc-text"> 6.6 Silence </div> </a> <ul id="toc-Silence-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-The_Turing_Trap" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#The_Turing_Trap"> <div class="vector-toc-text"> 6.7 The Turing Trap </div> </a> <ul id="toc-The_Turing_Trap-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Variations" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Variations"> <div class="vector-toc-text"> 7 Variations </div> </a> <button aria-controls="toc-Variations-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Variations subsection </button> <ul id="toc-Variations-sublist" class="vector-toc-list"> <li id="toc-Reverse_Turing_test_and_CAPTCHA" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Reverse_Turing_test_and_CAPTCHA"> <div class="vector-toc-text"> 7.1 Reverse Turing test and CAPTCHA </div> </a> <ul id="toc-Reverse_Turing_test_and_CAPTCHA-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Distinguishing_accurate_use_of_language_from_actual_understanding" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Distinguishing_accurate_use_of_language_from_actual_understanding"> <div class="vector-toc-text"> 7.2 Distinguishing accurate use of language from actual understanding </div> </a> <ul id="toc-Distinguishing_accurate_use_of_language_from_actual_understanding-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Subject_matter_expert_Turing_test" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Subject_matter_expert_Turing_test"> <div class="vector-toc-text"> 7.3 Subject matter expert Turing test </div> </a> <ul id="toc-Subject_matter_expert_Turing_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-"Low-level"_cognition_test" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#"Low-level"_cognition_test"> <div class="vector-toc-text"> 7.4 "Low-level" cognition test </div> </a> <ul id="toc-"Low-level"_cognition_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Total_Turing_test" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Total_Turing_test"> <div class="vector-toc-text"> 7.5 Total Turing test </div> </a> <ul id="toc-Total_Turing_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Electronic_health_records" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Electronic_health_records"> <div class="vector-toc-text"> 7.6 Electronic health records </div> </a> <ul id="toc-Electronic_health_records-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Minimum_intelligent_signal_test" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Minimum_intelligent_signal_test"> <div class="vector-toc-text"> 7.7 Minimum intelligent signal test </div> </a> <ul id="toc-Minimum_intelligent_signal_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Hutter_Prize" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Hutter_Prize"> <div class="vector-toc-text"> 7.8 Hutter Prize </div> </a> <ul id="toc-Hutter_Prize-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Other_tests_based_on_compression_or_Kolmogorov_complexity" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Other_tests_based_on_compression_or_Kolmogorov_complexity"> <div class="vector-toc-text"> 7.9 Other tests based on compression or Kolmogorov complexity </div> </a> <ul id="toc-Other_tests_based_on_compression_or_Kolmogorov_complexity-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ebert_test" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Ebert_test"> <div class="vector-toc-text"> 7.10 Ebert test </div> </a> <ul id="toc-Ebert_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Social_Turing_game" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Social_Turing_game"> <div class="vector-toc-text"> 7.11 Social Turing game </div> </a> <ul id="toc-Social_Turing_game-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Conferences" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Conferences"> <div class="vector-toc-text"> 8 Conferences </div> </a> <button aria-controls="toc-Conferences-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Conferences subsection </button> <ul id="toc-Conferences-sublist" class="vector-toc-list"> <li id="toc-Turing_Colloquium" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Turing_Colloquium"> <div class="vector-toc-text"> 8.1 Turing Colloquium </div> </a> <ul id="toc-Turing_Colloquium-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-2008_AISB_Symposium" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#2008_AISB_Symposium"> <div class="vector-toc-text"> 8.2 2008 AISB Symposium </div> </a> <ul id="toc-2008_AISB_Symposium-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-See_also" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#See_also"> <div class="vector-toc-text"> 9 See also </div> </a> <ul id="toc-See_also-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Notes" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Notes"> <div class="vector-toc-text"> 10 Notes </div> </a> <ul id="toc-Notes-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-References" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#References"> <div class="vector-toc-text"> 11 References </div> </a> <ul id="toc-References-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Further_reading" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Further_reading"> <div class="vector-toc-text"> 12 Further reading </div> </a> <ul id="toc-Further_reading-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-External_links" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#External_links"> <div class="vector-toc-text"> 13 External links </div> </a> <ul id="toc-External_links-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Toggle the table of contents </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading">Turing test</h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Go to an article in another language. Available in 64 languages" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-64" aria-hidden="true" > 64 languages </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-af mw-list-item"><a href="https://af.wikipedia.org/wiki/Turingtoets" title="Turingtoets – Afrikaans" lang="af" hreflang="af" data-title="Turingtoets" data-language-autonym="Afrikaans" data-language-local-name="Afrikaans" class="interlanguage-link-target">Afrikaans</a></li><li class="interlanguage-link interwiki-ar mw-list-item"><a href="https://ar.wikipedia.org/wiki/%D8%A7%D8%AE%D8%AA%D8%A8%D8%A7%D8%B1_%D8%AA%D9%88%D8%B1%D9%86%D8%BA" title="اختبار تورنغ – Arabic" lang="ar" hreflang="ar" data-title="اختبار تورنغ" data-language-autonym="العربية" data-language-local-name="Arabic" class="interlanguage-link-target">العربية</a></li><li class="interlanguage-link interwiki-as mw-list-item"><a href="https://as.wikipedia.org/wiki/%E0%A6%9F%E0%A6%BF%E0%A6%89%E0%A7%B0%E0%A6%BF%E0%A6%82_%E0%A6%AA%E0%A7%B0%E0%A7%80%E0%A6%95%E0%A7%8D%E0%A6%B7%E0%A6%BE" title="টিউৰিং পৰীক্ষা – Assamese" lang="as" hreflang="as" data-title="টিউৰিং পৰীক্ষা" data-language-autonym="অসমীয়া" data-language-local-name="Assamese" class="interlanguage-link-target">অসমীয়া</a></li><li class="interlanguage-link interwiki-az mw-list-item"><a href="https://az.wikipedia.org/wiki/T%C3%BCrinq_testi" title="Türinq testi – Azerbaijani" lang="az" hreflang="az" data-title="Türinq testi" data-language-autonym="Azərbaycanca" data-language-local-name="Azerbaijani" class="interlanguage-link-target">Azərbaycanca</a></li><li class="interlanguage-link interwiki-bn mw-list-item"><a href="https://bn.wikipedia.org/wiki/%E0%A6%9F%E0%A7%81%E0%A6%B0%E0%A6%BF%E0%A6%82_%E0%A6%AA%E0%A6%B0%E0%A7%80%E0%A6%95%E0%A7%8D%E0%A6%B7%E0%A6%BE" title="টুরিং পরীক্ষা – Bangla" lang="bn" hreflang="bn" data-title="টুরিং পরীক্ষা" data-language-autonym="বাংলা" data-language-local-name="Bangla" class="interlanguage-link-target">বাংলা</a></li><li class="interlanguage-link interwiki-be mw-list-item"><a href="https://be.wikipedia.org/wiki/%D0%A2%D1%8D%D1%81%D1%82_%D0%A6%D1%8C%D1%8E%D1%80%D1%8B%D0%BD%D0%B3%D0%B0" title="Тэст Цьюрынга – Belarusian" lang="be" hreflang="be" data-title="Тэст Цьюрынга" data-language-autonym="Беларуская" data-language-local-name="Belarusian" class="interlanguage-link-target">Беларуская</a></li><li class="interlanguage-link interwiki-bg mw-list-item"><a href="https://bg.wikipedia.org/wiki/%D0%A2%D0%B5%D1%81%D1%82_%D0%BD%D0%B0_%D0%A2%D1%8E%D1%80%D0%B8%D0%BD%D0%B3" title="Тест на Тюринг – Bulgarian" lang="bg" hreflang="bg" data-title="Тест на Тюринг" data-language-autonym="Български" data-language-local-name="Bulgarian" class="interlanguage-link-target">Български</a></li><li class="interlanguage-link interwiki-ca mw-list-item"><a href="https://ca.wikipedia.org/wiki/Test_de_Turing" title="Test de Turing – Catalan" lang="ca" hreflang="ca" data-title="Test de Turing" data-language-autonym="Català" data-language-local-name="Catalan" class="interlanguage-link-target">Català</a></li><li class="interlanguage-link interwiki-cs mw-list-item"><a href="https://cs.wikipedia.org/wiki/Turing%C5%AFv_test" title="Turingův test – Czech" lang="cs" hreflang="cs" data-title="Turingův test" data-language-autonym="Čeština" data-language-local-name="Czech" class="interlanguage-link-target">Čeština</a></li><li class="interlanguage-link interwiki-cy mw-list-item"><a href="https://cy.wikipedia.org/wiki/Prawf_Turing" title="Prawf Turing – Welsh" lang="cy" hreflang="cy" data-title="Prawf Turing" data-language-autonym="Cymraeg" data-language-local-name="Welsh" class="interlanguage-link-target">Cymraeg</a></li><li class="interlanguage-link interwiki-da mw-list-item"><a href="https://da.wikipedia.org/wiki/Turing-test" title="Turing-test – Danish" lang="da" hreflang="da" data-title="Turing-test" data-language-autonym="Dansk" data-language-local-name="Danish" class="interlanguage-link-target">Dansk</a></li><li class="interlanguage-link interwiki-de mw-list-item"><a href="https://de.wikipedia.org/wiki/Turing-Test" title="Turing-Test – German" lang="de" hreflang="de" data-title="Turing-Test" data-language-autonym="Deutsch" data-language-local-name="German" class="interlanguage-link-target">Deutsch</a></li><li class="interlanguage-link interwiki-et mw-list-item"><a href="https://et.wikipedia.org/wiki/Turingi_test" title="Turingi test – Estonian" lang="et" hreflang="et" data-title="Turingi test" data-language-autonym="Eesti" data-language-local-name="Estonian" class="interlanguage-link-target">Eesti</a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wikipedia.org/wiki/Prueba_de_Turing" title="Prueba de Turing – Spanish" lang="es" hreflang="es" data-title="Prueba de Turing" data-language-autonym="Español" data-language-local-name="Spanish" class="interlanguage-link-target">Español</a></li><li class="interlanguage-link interwiki-eo mw-list-item"><a href="https://eo.wikipedia.org/wiki/Testo_de_Turing" title="Testo de Turing – Esperanto" lang="eo" hreflang="eo" data-title="Testo de Turing" data-language-autonym="Esperanto" data-language-local-name="Esperanto" class="interlanguage-link-target">Esperanto</a></li><li class="interlanguage-link interwiki-eu mw-list-item"><a href="https://eu.wikipedia.org/wiki/Turingen_testa" title="Turingen testa – Basque" lang="eu" hreflang="eu" data-title="Turingen testa" data-language-autonym="Euskara" data-language-local-name="Basque" class="interlanguage-link-target">Euskara</a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D8%A2%D8%B2%D9%85%D9%88%D9%86_%D8%AA%D9%88%D8%B1%DB%8C%D9%86%DA%AF" title="آزمون تورینگ – Persian" lang="fa" hreflang="fa" data-title="آزمون تورینگ" data-language-autonym="فارسی" data-language-local-name="Persian" class="interlanguage-link-target">فارسی</a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Test_de_Turing" title="Test de Turing – French" lang="fr" hreflang="fr" data-title="Test de Turing" data-language-autonym="Français" data-language-local-name="French" class="interlanguage-link-target">Français</a></li><li class="interlanguage-link interwiki-ga mw-list-item"><a href="https://ga.wikipedia.org/wiki/T%C3%A1st%C3%A1il_Turing" title="Tástáil Turing – Irish" lang="ga" hreflang="ga" data-title="Tástáil Turing" data-language-autonym="Gaeilge" data-language-local-name="Irish" class="interlanguage-link-target">Gaeilge</a></li><li class="interlanguage-link interwiki-gl mw-list-item"><a href="https://gl.wikipedia.org/wiki/Proba_de_Turing" title="Proba de Turing – Galician" lang="gl" hreflang="gl" data-title="Proba de Turing" data-language-autonym="Galego" data-language-local-name="Galician" class="interlanguage-link-target">Galego</a></li><li class="interlanguage-link interwiki-ko mw-list-item"><a href="https://ko.wikipedia.org/wiki/%ED%8A%9C%EB%A7%81_%ED%85%8C%EC%8A%A4%ED%8A%B8" title="튜링 테스트 – Korean" lang="ko" hreflang="ko" data-title="튜링 테스트" data-language-autonym="한국어" data-language-local-name="Korean" class="interlanguage-link-target">한국어</a></li><li class="interlanguage-link interwiki-hy mw-list-item"><a href="https://hy.wikipedia.org/wiki/%D4%B9%D5%B5%D5%B8%D6%82%D6%80%D5%AB%D5%B6%D5%A3%D5%AB_%D5%A9%D5%A5%D5%BD%D5%BF" title="Թյուրինգի թեստ – Armenian" lang="hy" hreflang="hy" data-title="Թյուրինգի թեստ" data-language-autonym="Հայերեն" data-language-local-name="Armenian" class="interlanguage-link-target">Հայերեն</a></li><li class="interlanguage-link interwiki-hi mw-list-item"><a href="https://hi.wikipedia.org/wiki/%E0%A4%9F%E0%A5%8D%E0%A4%AF%E0%A5%82%E0%A4%B0%E0%A4%BF%E0%A4%82%E0%A4%97_%E0%A4%9F%E0%A5%87%E0%A4%B8%E0%A5%8D%E0%A4%9F" title="ट्यूरिंग टेस्ट – Hindi" lang="hi" hreflang="hi" data-title="ट्यूरिंग टेस्ट" data-language-autonym="हिन्दी" data-language-local-name="Hindi" class="interlanguage-link-target">हिन्दी</a></li><li class="interlanguage-link interwiki-hr mw-list-item"><a href="https://hr.wikipedia.org/wiki/Turingov_test" title="Turingov test – Croatian" lang="hr" hreflang="hr" data-title="Turingov test" data-language-autonym="Hrvatski" data-language-local-name="Croatian" class="interlanguage-link-target">Hrvatski</a></li><li class="interlanguage-link interwiki-id mw-list-item"><a href="https://id.wikipedia.org/wiki/Uji_Turing" title="Uji Turing – Indonesian" lang="id" hreflang="id" data-title="Uji Turing" data-language-autonym="Bahasa Indonesia" data-language-local-name="Indonesian" class="interlanguage-link-target">Bahasa Indonesia</a></li><li class="interlanguage-link interwiki-is mw-list-item"><a href="https://is.wikipedia.org/wiki/Pr%C3%B3f_Turings" title="Próf Turings – Icelandic" lang="is" hreflang="is" data-title="Próf Turings" data-language-autonym="Íslenska" data-language-local-name="Icelandic" class="interlanguage-link-target">Íslenska</a></li><li class="interlanguage-link interwiki-it mw-list-item"><a href="https://it.wikipedia.org/wiki/Test_di_Turing" title="Test di Turing – Italian" lang="it" hreflang="it" data-title="Test di Turing" data-language-autonym="Italiano" data-language-local-name="Italian" class="interlanguage-link-target">Italiano</a></li><li class="interlanguage-link interwiki-he mw-list-item"><a href="https://he.wikipedia.org/wiki/%D7%9E%D7%91%D7%97%D7%9F_%D7%98%D7%99%D7%95%D7%A8%D7%99%D7%A0%D7%92" title="מבחן טיורינג – Hebrew" lang="he" hreflang="he" data-title="מבחן טיורינג" data-language-autonym="עברית" data-language-local-name="Hebrew" class="interlanguage-link-target">עברית</a></li><li class="interlanguage-link interwiki-ka mw-list-item"><a href="https://ka.wikipedia.org/wiki/%E1%83%A2%E1%83%98%E1%83%A3%E1%83%A0%E1%83%98%E1%83%9C%E1%83%92%E1%83%98%E1%83%A1_%E1%83%A2%E1%83%94%E1%83%A1%E1%83%A2%E1%83%98" title="ტიურინგის ტესტი – Georgian" lang="ka" hreflang="ka" data-title="ტიურინგის ტესტი" data-language-autonym="ქართული" data-language-local-name="Georgian" class="interlanguage-link-target">ქართული</a></li><li class="interlanguage-link interwiki-kk mw-list-item"><a href="https://kk.wikipedia.org/wiki/%D0%A2%D1%8C%D1%8E%D1%80%D0%B8%D0%BD%D0%B3_%D1%82%D0%B5%D1%81%D1%82%D1%96" title="Тьюринг тесті – Kazakh" lang="kk" hreflang="kk" data-title="Тьюринг тесті" data-language-autonym="Қазақша" data-language-local-name="Kazakh" class="interlanguage-link-target">Қазақша</a></li><li class="interlanguage-link interwiki-la mw-list-item"><a href="https://la.wikipedia.org/wiki/Examen_Turing" title="Examen Turing – Latin" lang="la" hreflang="la" data-title="Examen Turing" data-language-autonym="Latina" data-language-local-name="Latin" class="interlanguage-link-target">Latina</a></li><li class="interlanguage-link interwiki-lv mw-list-item"><a href="https://lv.wikipedia.org/wiki/Tj%C5%ABringa_tests" title="Tjūringa tests – Latvian" lang="lv" hreflang="lv" data-title="Tjūringa tests" data-language-autonym="Latviešu" data-language-local-name="Latvian" class="interlanguage-link-target">Latviešu</a></li><li class="interlanguage-link interwiki-lt mw-list-item"><a href="https://lt.wikipedia.org/wiki/Tiuringo_testas" title="Tiuringo testas – Lithuanian" lang="lt" hreflang="lt" data-title="Tiuringo testas" data-language-autonym="Lietuvių" data-language-local-name="Lithuanian" class="interlanguage-link-target">Lietuvių</a></li><li class="interlanguage-link interwiki-hu mw-list-item"><a href="https://hu.wikipedia.org/wiki/Turing-teszt" title="Turing-teszt – Hungarian" lang="hu" hreflang="hu" data-title="Turing-teszt" data-language-autonym="Magyar" data-language-local-name="Hungarian" class="interlanguage-link-target">Magyar</a></li><li class="interlanguage-link interwiki-mk mw-list-item"><a href="https://mk.wikipedia.org/wiki/%D0%A2%D1%98%D1%83%D1%80%D0%B8%D0%BD%D0%B3%D0%BE%D0%B2%D0%B0_%D0%BF%D1%80%D0%BE%D0%B2%D0%B5%D1%80%D0%BA%D0%B0" title="Тјурингова проверка – Macedonian" lang="mk" hreflang="mk" data-title="Тјурингова проверка" data-language-autonym="Македонски" data-language-local-name="Macedonian" class="interlanguage-link-target">Македонски</a></li><li class="interlanguage-link interwiki-ml mw-list-item"><a href="https://ml.wikipedia.org/wiki/%E0%B4%9F%E0%B5%82%E0%B4%B1%E0%B4%BF%E0%B4%99%E0%B5%8D_%E0%B4%9F%E0%B5%86%E0%B4%B8%E0%B5%8D%E0%B4%B1%E0%B5%8D%E0%B4%B1%E0%B5%8D" title="ടൂറിങ് ടെസ്റ്റ് – Malayalam" lang="ml" hreflang="ml" data-title="ടൂറിങ് ടെസ്റ്റ്" data-language-autonym="മലയാളം" data-language-local-name="Malayalam" class="interlanguage-link-target">മലയാളം</a></li><li class="interlanguage-link interwiki-ms mw-list-item"><a href="https://ms.wikipedia.org/wiki/Ujian_Turing" title="Ujian Turing – Malay" lang="ms" hreflang="ms" data-title="Ujian Turing" data-language-autonym="Bahasa Melayu" data-language-local-name="Malay" class="interlanguage-link-target">Bahasa Melayu</a></li><li class="interlanguage-link interwiki-mn mw-list-item"><a href="https://mn.wikipedia.org/wiki/%D0%A2%D1%8E%D1%80%D0%B8%D0%BD%D0%B3_%D1%82%D0%B5%D1%81%D1%82" title="Тюринг тест – Mongolian" lang="mn" hreflang="mn" data-title="Тюринг тест" data-language-autonym="Монгол" data-language-local-name="Mongolian" class="interlanguage-link-target">Монгол</a></li><li class="interlanguage-link interwiki-nl mw-list-item"><a href="https://nl.wikipedia.org/wiki/Turingtest" title="Turingtest – Dutch" lang="nl" hreflang="nl" data-title="Turingtest" data-language-autonym="Nederlands" data-language-local-name="Dutch" class="interlanguage-link-target">Nederlands</a></li><li class="interlanguage-link interwiki-ja mw-list-item"><a href="https://ja.wikipedia.org/wiki/%E3%83%81%E3%83%A5%E3%83%BC%E3%83%AA%E3%83%B3%E3%82%B0%E3%83%BB%E3%83%86%E3%82%B9%E3%83%88" title="チューリング・テスト – Japanese" lang="ja" hreflang="ja" data-title="チューリング・テスト" data-language-autonym="日本語" data-language-local-name="Japanese" class="interlanguage-link-target">日本語</a></li><li class="interlanguage-link interwiki-frr mw-list-item"><a href="https://frr.wikipedia.org/wiki/Turing-Test" title="Turing-Test – Northern Frisian" lang="frr" hreflang="frr" data-title="Turing-Test" data-language-autonym="Nordfriisk" data-language-local-name="Northern Frisian" class="interlanguage-link-target">Nordfriisk</a></li><li class="interlanguage-link interwiki-no mw-list-item"><a href="https://no.wikipedia.org/wiki/Turingtest" title="Turingtest – Norwegian Bokmål" lang="nb" hreflang="nb" data-title="Turingtest" data-language-autonym="Norsk bokmål" data-language-local-name="Norwegian Bokmål" class="interlanguage-link-target">Norsk bokmål</a></li><li class="interlanguage-link interwiki-uz mw-list-item"><a href="https://uz.wikipedia.org/wiki/Turing_testi" title="Turing testi – Uzbek" lang="uz" hreflang="uz" data-title="Turing testi" data-language-autonym="Oʻzbekcha / ўзбекча" data-language-local-name="Uzbek" class="interlanguage-link-target">Oʻzbekcha / ўзбекча</a></li><li class="interlanguage-link interwiki-ps mw-list-item"><a href="https://ps.wikipedia.org/wiki/%D8%AF_%D8%AA%D9%88%D8%B1%D9%8A%D9%86%DA%AB_%D8%A7%D8%B2%D9%85%D9%88%D9%8A%D9%86%D9%87" title="د تورينګ ازموينه – Pashto" lang="ps" hreflang="ps" data-title="د تورينګ ازموينه" data-language-autonym="پښتو" data-language-local-name="Pashto" class="interlanguage-link-target">پښتو</a></li><li class="interlanguage-link interwiki-pl mw-list-item"><a href="https://pl.wikipedia.org/wiki/Test_Turinga" title="Test Turinga – Polish" lang="pl" hreflang="pl" data-title="Test Turinga" data-language-autonym="Polski" data-language-local-name="Polish" class="interlanguage-link-target">Polski</a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/Teste_de_Turing" title="Teste de Turing – Portuguese" lang="pt" hreflang="pt" data-title="Teste de Turing" data-language-autonym="Português" data-language-local-name="Portuguese" class="interlanguage-link-target">Português</a></li><li class="interlanguage-link interwiki-ro mw-list-item"><a href="https://ro.wikipedia.org/wiki/Testul_Turing" title="Testul Turing – Romanian" lang="ro" hreflang="ro" data-title="Testul Turing" data-language-autonym="Română" data-language-local-name="Romanian" class="interlanguage-link-target">Română</a></li><li class="interlanguage-link interwiki-ru mw-list-item"><a href="https://ru.wikipedia.org/wiki/%D0%A2%D0%B5%D1%81%D1%82_%D0%A2%D1%8C%D1%8E%D1%80%D0%B8%D0%BD%D0%B3%D0%B0" title="Тест Тьюринга – Russian" lang="ru" hreflang="ru" data-title="Тест Тьюринга" data-language-autonym="Русский" data-language-local-name="Russian" class="interlanguage-link-target">Русский</a></li><li class="interlanguage-link interwiki-sco mw-list-item"><a href="https://sco.wikipedia.org/wiki/Turing_test" title="Turing test – Scots" lang="sco" hreflang="sco" data-title="Turing test" data-language-autonym="Scots" data-language-local-name="Scots" class="interlanguage-link-target">Scots</a></li><li class="interlanguage-link interwiki-sq mw-list-item"><a href="https://sq.wikipedia.org/wiki/Testi_i_Turingut" title="Testi i Turingut – Albanian" lang="sq" hreflang="sq" data-title="Testi i Turingut" data-language-autonym="Shqip" data-language-local-name="Albanian" class="interlanguage-link-target">Shqip</a></li><li class="interlanguage-link interwiki-simple mw-list-item"><a href="https://simple.wikipedia.org/wiki/Turing_test" title="Turing test – Simple English" lang="en-simple" hreflang="en-simple" data-title="Turing test" data-language-autonym="Simple English" data-language-local-name="Simple English" class="interlanguage-link-target">Simple English</a></li><li class="interlanguage-link interwiki-sk mw-list-item"><a href="https://sk.wikipedia.org/wiki/Turingov_test" title="Turingov test – Slovak" lang="sk" hreflang="sk" data-title="Turingov test" data-language-autonym="Slovenčina" data-language-local-name="Slovak" class="interlanguage-link-target">Slovenčina</a></li><li class="interlanguage-link interwiki-sl mw-list-item"><a href="https://sl.wikipedia.org/wiki/Turingov_test" title="Turingov test – Slovenian" lang="sl" hreflang="sl" data-title="Turingov test" data-language-autonym="Slovenščina" data-language-local-name="Slovenian" class="interlanguage-link-target">Slovenščina</a></li><li class="interlanguage-link interwiki-sr mw-list-item"><a href="https://sr.wikipedia.org/wiki/%D0%A2%D1%98%D1%83%D1%80%D0%B8%D0%BD%D0%B3%D0%BE%D0%B2_%D1%82%D0%B5%D1%81%D1%82" title="Тјурингов тест – Serbian" lang="sr" hreflang="sr" data-title="Тјурингов тест" data-language-autonym="Српски / srpski" data-language-local-name="Serbian" class="interlanguage-link-target">Српски / srpski</a></li><li class="interlanguage-link interwiki-sh mw-list-item"><a href="https://sh.wikipedia.org/wiki/Turingov_test" title="Turingov test – Serbo-Croatian" lang="sh" hreflang="sh" data-title="Turingov test" data-language-autonym="Srpskohrvatski / српскохрватски" data-language-local-name="Serbo-Croatian" class="interlanguage-link-target">Srpskohrvatski / српскохрватски</a></li><li class="interlanguage-link interwiki-fi mw-list-item"><a href="https://fi.wikipedia.org/wiki/Turingin_testi" title="Turingin testi – Finnish" lang="fi" hreflang="fi" data-title="Turingin testi" data-language-autonym="Suomi" data-language-local-name="Finnish" class="interlanguage-link-target">Suomi</a></li><li class="interlanguage-link interwiki-sv mw-list-item"><a href="https://sv.wikipedia.org/wiki/Turingtestet" title="Turingtestet – Swedish" lang="sv" hreflang="sv" data-title="Turingtestet" data-language-autonym="Svenska" data-language-local-name="Swedish" class="interlanguage-link-target">Svenska</a></li><li class="interlanguage-link interwiki-th mw-list-item"><a href="https://th.wikipedia.org/wiki/%E0%B8%81%E0%B8%B2%E0%B8%A3%E0%B8%97%E0%B8%94%E0%B8%AA%E0%B8%AD%E0%B8%9A%E0%B8%97%E0%B8%B1%E0%B8%A7%E0%B8%A3%E0%B8%B4%E0%B8%87" title="การทดสอบทัวริง – Thai" lang="th" hreflang="th" data-title="การทดสอบทัวริง" data-language-autonym="ไทย" data-language-local-name="Thai" class="interlanguage-link-target">ไทย</a></li><li class="interlanguage-link interwiki-tr mw-list-item"><a href="https://tr.wikipedia.org/wiki/Turing_testi" title="Turing testi – Turkish" lang="tr" hreflang="tr" data-title="Turing testi" data-language-autonym="Türkçe" data-language-local-name="Turkish" class="interlanguage-link-target">Türkçe</a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wikipedia.org/wiki/%D0%A2%D0%B5%D1%81%D1%82_%D0%A2%D1%8E%D1%80%D1%96%D0%BD%D0%B3%D0%B0" title="Тест Тюрінга – Ukrainian" lang="uk" hreflang="uk" data-title="Тест Тюрінга" data-language-autonym="Українська" data-language-local-name="Ukrainian" class="interlanguage-link-target">Українська</a></li><li class="interlanguage-link interwiki-vi mw-list-item"><a href="https://vi.wikipedia.org/wiki/Ph%C3%A9p_th%E1%BB%AD_Turing" title="Phép thử Turing – Vietnamese" lang="vi" hreflang="vi" data-title="Phép thử Turing" data-language-autonym="Tiếng Việt" data-language-local-name="Vietnamese" class="interlanguage-link-target">Tiếng Việt</a></li><li class="interlanguage-link interwiki-wuu mw-list-item"><a href="https://wuu.wikipedia.org/wiki/%E5%9B%BE%E7%81%B5%E6%B5%8B%E8%AF%95" title="图灵测试 – Wu" lang="wuu" hreflang="wuu" data-title="图灵测试" data-language-autonym="吴语" data-language-local-name="Wu" class="interlanguage-link-target">吴语</a></li><li class="interlanguage-link interwiki-zh-yue mw-list-item"><a href="https://zh-yue.wikipedia.org/wiki/%E5%9C%96%E9%9D%88%E6%B8%AC%E8%A9%A6" title="圖靈測試 – Cantonese" lang="yue" hreflang="yue" data-title="圖靈測試" data-language-autonym="粵語" data-language-local-name="Cantonese" class="interlanguage-link-target">粵語</a></li><li class="interlanguage-link interwiki-zh mw-list-item"><a href="https://zh.wikipedia.org/wiki/%E5%9B%BE%E7%81%B5%E6%B5%8B%E8%AF%95" title="图灵测试 – Chinese" lang="zh" hreflang="zh" data-title="图灵测试" data-language-autonym="中文" data-language-local-name="Chinese" class="interlanguage-link-target">中文</a></li> </ul> <div class="after-portlet after-portlet-lang"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q189223#sitelinks-wikipedia" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Turing_test" title="View the content page [c]" accesskey="c">Article</a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:Turing_test" rel="discussion" title="Discuss improvements to the content page [t]" accesskey="t">Talk</a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >English </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Turing_test">Read</a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Turing_test&action=edit" title="Edit this page [e]" accesskey="e">Edit</a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Turing_test&action=history" title="Past revisions of this page [h]" accesskey="h">View history</a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >Tools </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Turing_test">Read</a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Turing_test&action=edit" title="Edit this page [e]" accesskey="e">Edit</a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Turing_test&action=history">View history</a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/Turing_test" title="List of all English Wikipedia pages containing links to this page [j]" accesskey="j">What links here</a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Turing_test" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k">Related changes</a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_Upload_Wizard" title="Upload files [u]" accesskey="u">Upload file</a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q">Special pages</a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Turing_test&oldid=1257901311" title="Permanent link to this revision of this page">Permanent link</a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Turing_test&action=info" title="More information about this page">Page information</a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:CiteThisPage&page=Turing_test&id=1257901311&wpFormIdentifier=titleform" title="Information on how to cite this page">Cite this page</a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FTuring_test">Get shortened URL</a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FTuring_test">Download QR code</a></li> </ul> </div> </div> <div id="p-coll-print_export" class="vector-menu mw-portlet mw-portlet-coll-print_export" > <div class="vector-menu-heading"> Print/export </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="coll-download-as-rl" class="mw-list-item"><a href="/w/index.php?title=Special:DownloadAsPdf&page=Turing_test&action=show-download-screen" title="Download this page as a PDF file">Download as PDF</a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=Turing_test&printable=yes" title="Printable version of this page [p]" accesskey="p">Printable version</a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> In other projects </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="wb-otherproject-link wb-otherproject-commons mw-list-item"><a href="https://commons.wikimedia.org/wiki/Category:Turing_test" hreflang="en">Wikimedia Commons</a></li><li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q189223" title="Structured data on this page hosted by Wikidata [g]" accesskey="g">Wikidata item</a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> </div> <div id="siteSub" class="noprint">From Wikipedia, the free encyclopedia</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><div class="shortdescription nomobile noexcerpt noprint searchaux" style="display:none">Test of a machine's ability to imitate human intelligence</div> <style data-mw-deduplicate="TemplateStyles:r1236090951">.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}</style><div role="note" class="hatnote navigation-not-searchable">"Imitation game" redirects here. For the film, see <a href="/wiki/The_Imitation_Game" title="The Imitation Game">The Imitation Game</a>. For other uses, see <a href="/wiki/Turing_test_(disambiguation)" class="mw-disambig" title="Turing test (disambiguation)">Turing test (disambiguation)</a>.</div> <style data-mw-deduplicate="TemplateStyles:r1129693374">.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}</style><style data-mw-deduplicate="TemplateStyles:r1246091330">.mw-parser-output .sidebar{width:22em;float:right;clear:right;margin:0.5em 0 1em 1em;background:var(--background-color-neutral-subtle,#f8f9fa);border:1px solid var(--border-color-base,#a2a9b1);padding:0.2em;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse;display:table}body.skin-minerva .mw-parser-output .sidebar{display:table!important;float:right!important;margin:0.5em 0 1em 1em!important}.mw-parser-output .sidebar-subgroup{width:100%;margin:0;border-spacing:0}.mw-parser-output .sidebar-left{float:left;clear:left;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-none{float:none;clear:both;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-outer-title{padding:0 0.4em 0.2em;font-size:125%;line-height:1.2em;font-weight:bold}.mw-parser-output .sidebar-top-image{padding:0.4em}.mw-parser-output .sidebar-top-caption,.mw-parser-output .sidebar-pretitle-with-top-image,.mw-parser-output .sidebar-caption{padding:0.2em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-pretitle{padding:0.4em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-title,.mw-parser-output .sidebar-title-with-pretitle{padding:0.2em 0.8em;font-size:145%;line-height:1.2em}.mw-parser-output .sidebar-title-with-pretitle{padding:0.1em 0.4em}.mw-parser-output .sidebar-image{padding:0.2em 0.4em 0.4em}.mw-parser-output .sidebar-heading{padding:0.1em 0.4em}.mw-parser-output .sidebar-content{padding:0 0.5em 0.4em}.mw-parser-output .sidebar-content-with-subgroup{padding:0.1em 0.4em 0.2em}.mw-parser-output .sidebar-above,.mw-parser-output .sidebar-below{padding:0.3em 0.8em;font-weight:bold}.mw-parser-output .sidebar-collapse .sidebar-above,.mw-parser-output .sidebar-collapse .sidebar-below{border-top:1px solid #aaa;border-bottom:1px solid #aaa}.mw-parser-output .sidebar-navbar{text-align:right;font-size:115%;padding:0 0.4em 0.4em}.mw-parser-output .sidebar-list-title{padding:0 0.4em;text-align:left;font-weight:bold;line-height:1.6em;font-size:105%}.mw-parser-output .sidebar-list-title-c{padding:0 0.4em;text-align:center;margin:0 3.3em}@media(max-width:640px){body.mediawiki .mw-parser-output .sidebar{width:100%!important;clear:both;float:none!important;margin-left:0!important;margin-right:0!important}}body.skin--responsive .mw-parser-output .sidebar a>img{max-width:none!important}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media print{body.ns-0 .mw-parser-output .sidebar{display:none!important}}</style><table class="sidebar sidebar-collapse nomobile nowraplinks hlist"><tbody><tr><td class="sidebar-pretitle">Part of a series on</td></tr><tr><th class="sidebar-title-with-pretitle"><a href="/wiki/Artificial_intelligence" title="Artificial intelligence">Artificial intelligence</a></th></tr><tr><td class="sidebar-image"><figure class="mw-halign-center" typeof="mw:File"><a href="/wiki/File:Dall-e_3_(jan_%2724)_artificial_intelligence_icon.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/6/64/Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png/100px-Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png" decoding="async" width="100" height="100" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/6/64/Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png/150px-Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/6/64/Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png/200px-Dall-e_3_%28jan_%2724%29_artificial_intelligence_icon.png 2x" data-file-width="820" data-file-height="820" /></a><figcaption></figcaption></figure></td></tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible mw-collapsed"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)"><a href="/wiki/Artificial_intelligence#Goals" title="Artificial intelligence">Major goals</a></div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Artificial_general_intelligence" title="Artificial general intelligence">Artificial general intelligence</a></li> <li><a href="/wiki/Intelligent_agent" title="Intelligent agent">Intelligent agent</a></li> <li><a href="/wiki/Recursive_self-improvement" title="Recursive self-improvement">Recursive self-improvement</a></li> <li><a href="/wiki/Automated_planning_and_scheduling" title="Automated planning and scheduling">Planning</a></li> <li><a href="/wiki/Computer_vision" title="Computer vision">Computer vision</a></li> <li><a href="/wiki/General_game_playing" title="General game playing">General game playing</a></li> <li><a href="/wiki/Knowledge_representation_and_reasoning" title="Knowledge representation and reasoning">Knowledge reasoning</a></li> <li><a href="/wiki/Natural_language_processing" title="Natural language processing">Natural language processing</a></li> <li><a href="/wiki/Robotics" title="Robotics">Robotics</a></li> <li><a href="/wiki/AI_safety" title="AI safety">AI safety</a></li></ul></div></div></td> </tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible mw-collapsed"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)">Approaches</div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Machine_learning" title="Machine learning">Machine learning</a></li> <li><a href="/wiki/Symbolic_artificial_intelligence" title="Symbolic artificial intelligence">Symbolic</a></li> <li><a href="/wiki/Deep_learning" title="Deep learning">Deep learning</a></li> <li><a href="/wiki/Bayesian_network" title="Bayesian network">Bayesian networks</a></li> <li><a href="/wiki/Evolutionary_algorithm" title="Evolutionary algorithm">Evolutionary algorithms</a></li> <li><a href="/wiki/Hybrid_intelligent_system" title="Hybrid intelligent system">Hybrid intelligent systems</a></li> <li><a href="/wiki/Artificial_intelligence_systems_integration" title="Artificial intelligence systems integration">Systems integration</a></li></ul></div></div></td> </tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible mw-collapsed"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)"><a href="/wiki/Applications_of_artificial_intelligence" title="Applications of artificial intelligence">Applications</a></div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Machine_learning_in_bioinformatics" title="Machine learning in bioinformatics">Bioinformatics</a></li> <li><a href="/wiki/Deepfake" title="Deepfake">Deepfake</a></li> <li><a href="/wiki/Machine_learning_in_earth_sciences" title="Machine learning in earth sciences">Earth sciences</a></li> <li><a href="/wiki/Applications_of_artificial_intelligence#Finance" title="Applications of artificial intelligence"> Finance </a></li> <li><a href="/wiki/Generative_artificial_intelligence" title="Generative artificial intelligence">Generative AI</a> <ul><li><a href="/wiki/Artificial_intelligence_art" title="Artificial intelligence art">Art</a></li> <li><a href="/wiki/Generative_audio" title="Generative audio">Audio</a></li> <li><a href="/wiki/Music_and_artificial_intelligence" title="Music and artificial intelligence">Music</a></li></ul></li> <li><a href="/wiki/Artificial_intelligence_in_government" title="Artificial intelligence in government">Government</a></li> <li><a href="/wiki/Artificial_intelligence_in_healthcare" title="Artificial intelligence in healthcare">Healthcare</a> <ul><li><a href="/wiki/Artificial_intelligence_in_mental_health" title="Artificial intelligence in mental health">Mental health</a></li></ul></li> <li><a href="/wiki/Artificial_intelligence_in_industry" title="Artificial intelligence in industry">Industry</a></li> <li><a href="/wiki/Machine_translation" title="Machine translation">Translation</a></li> <li><a href="/wiki/Artificial_intelligence_arms_race" title="Artificial intelligence arms race"> Military </a></li> <li><a href="/wiki/Machine_learning_in_physics" title="Machine learning in physics">Physics</a></li> <li><a href="/wiki/List_of_artificial_intelligence_projects" title="List of artificial intelligence projects">Projects</a></li></ul></div></div></td> </tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)"><a href="/wiki/Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">Philosophy</a></div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Artificial_consciousness" title="Artificial consciousness">Artificial consciousness</a></li> <li><a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a></li> <li><a href="/wiki/Friendly_artificial_intelligence" title="Friendly artificial intelligence">Friendly AI</a></li> <li><a href="/wiki/AI_control_problem" class="mw-redirect" title="AI control problem">Control problem</a>/<a href="/wiki/AI_takeover" title="AI takeover">Takeover</a></li> <li><a href="/wiki/Ethics_of_artificial_intelligence" title="Ethics of artificial intelligence">Ethics</a></li> <li><a href="/wiki/Existential_risk_from_artificial_general_intelligence" class="mw-redirect" title="Existential risk from artificial general intelligence">Existential risk</a></li> <li><a href="/wiki/Regulation_of_artificial_intelligence" title="Regulation of artificial intelligence">Regulation</a></li> <li><a class="mw-selflink selflink">Turing test</a></li></ul></div></div></td> </tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible mw-collapsed"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)"><a href="/wiki/History_of_artificial_intelligence" title="History of artificial intelligence">History</a></div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Timeline_of_artificial_intelligence" title="Timeline of artificial intelligence">Timeline</a></li> <li><a href="/wiki/Progress_in_artificial_intelligence" title="Progress in artificial intelligence">Progress</a></li> <li><a href="/wiki/AI_winter" title="AI winter">AI winter</a></li> <li><a href="/wiki/AI_boom" title="AI boom">AI boom</a></li></ul></div></div></td> </tr><tr><td class="sidebar-content"> <div class="sidebar-list mw-collapsible mw-collapsed"><div class="sidebar-list-title" style="text-align:center;color: var(--color-base)">Glossary</div><div class="sidebar-list-content mw-collapsible-content"> <ul><li><a href="/wiki/Glossary_of_artificial_intelligence" title="Glossary of artificial intelligence">Glossary</a></li></ul></div></div></td> </tr><tr><td class="sidebar-navbar"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><style data-mw-deduplicate="TemplateStyles:r1239400231">.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}</style><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Artificial_intelligence" title="Template:Artificial intelligence"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Artificial_intelligence" title="Template talk:Artificial intelligence"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Artificial_intelligence" title="Special:EditPage/Template:Artificial intelligence"><abbr title="Edit this template">e</abbr></a></li></ul></div></td></tr></tbody></table> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Turing_test_diagram.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/5/55/Turing_test_diagram.png/220px-Turing_test_diagram.png" decoding="async" width="220" height="168" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/5/55/Turing_test_diagram.png/330px-Turing_test_diagram.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/5/55/Turing_test_diagram.png/440px-Turing_test_diagram.png 2x" data-file-width="661" data-file-height="504" /></a><figcaption>The "standard interpretation" of the Turing test, in which player C, the interrogator, is given the task of trying to determine which player – A or B – is a computer and which is a human. The interrogator is limited to using the responses to written questions to make the determination.<a href="#cite_note-1">[1]</a></figcaption></figure> The Turing test, originally called the imitation game by <a href="/wiki/Alan_Turing" title="Alan Turing">Alan Turing</a> in 1949,<a href="#cite_note-Turing-1950-2">[2]</a> is a test of a machine's ability to <a href="/wiki/Artificial_intelligence" title="Artificial intelligence">exhibit intelligent behaviour</a> equivalent to, or indistinguishable from, that of a human. Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses. The evaluator would be aware that one of the two partners in conversation was a machine, and all participants would be separated from one another. The conversation would be limited to a text-only channel, such as a computer keyboard and screen, so the result would not depend on the machine's ability to render words as speech.<a href="#cite_note-3">[3]</a> If the evaluator could not reliably tell the machine from the human, the machine would be said to have passed the test. The test results would not depend on the machine's ability to give correct <a href="/wiki/Question_answering" title="Question answering">answers to questions</a>, only on how closely its answers resembled those a human would give. Since the Turing test is a test of indistinguishability in performance capacity, the verbal version generalizes naturally to all of human performance capacity, verbal as well as nonverbal (robotic).<a href="#cite_note-The_Turing_Test-4">[4]</a> The test was introduced by Turing in his 1950 paper "<a href="/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence">Computing Machinery and Intelligence</a>" while working at the <a href="/wiki/University_of_Manchester" title="University of Manchester">University of Manchester</a>.<a href="#cite_note-5">[5]</a> It opens with the words: "I propose to consider the question, 'Can machines think?'" Because "thinking" is difficult to define, Turing chooses to "replace the question by another, which is closely related to it and is expressed in relatively unambiguous words".<a href="#cite_note-FOOTNOTETuring1950433-6">[6]</a> Turing describes the new form of the problem in terms of a three-person game called the "imitation game", in which an interrogator asks questions of a man and a woman in another room in order to determine the correct sex of the two players. Turing's new question is: "Are there imaginable digital computers which would do well in the imitation game?"<a href="#cite_note-Turing-1950-2">[2]</a> This question, Turing believed, was one that could actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that "machines can think".<a href="#cite_note-Turing's_nine_objections-7">[7]</a> Since Turing introduced his test, it has been both highly influential and widely criticized, and has become an important concept in the <a href="/wiki/Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">philosophy of artificial intelligence</a>.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a><a href="#cite_note-FOOTNOTERussellNorvig20032–3,_948-9">[9]</a> Philosopher <a href="/wiki/John_Searle" title="John Searle">John Searle</a> would comment on the Turing test in his <a href="/wiki/Chinese_room" title="Chinese room">Chinese room argument</a>, a thought experiment that stipulates that a machine cannot have a "<a href="/wiki/Mind" title="Mind">mind</a>", "<a href="/wiki/Intentionality" title="Intentionality">understanding</a>", or "<a href="/wiki/Consciousness" title="Consciousness">consciousness</a>", regardless of how intelligently or human-like the program may make the computer behave. Searle criticizes Turing's test and claims it is insufficient to detect the presence of consciousness. <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Chatbots">Chatbots</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=1" title="Edit section: Chatbots">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Chatbots" class="mw-redirect" title="Chatbots">Chatbots</a></div> The Turing Test later led to the development of '<a href="/wiki/Chatbot" title="Chatbot">chatbots</a>', AI software entities developed for the sole purpose of conducting text chat sessions with people. Today, chatbots have a more inclusive definition; a computer program that can hold a conversation with a person, usually over the internet. <a href="/wiki/OED" class="mw-redirect" title="OED">OED</a><a href="#cite_note-:0-10">[10]</a><a href="#cite_note-11">[11]</a> <div class="mw-heading mw-heading3"><h3 id="ELIZA_and_PARRY">ELIZA and PARRY</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=2" title="Edit section: ELIZA and PARRY">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main articles: <a href="/wiki/ELIZA" title="ELIZA">ELIZA</a> and <a href="/wiki/PARRY" title="PARRY">PARRY</a></div> In 1966, <a href="/wiki/Joseph_Weizenbaum" title="Joseph Weizenbaum">Joseph Weizenbaum</a> created a program called <a href="/wiki/ELIZA" title="ELIZA">ELIZA</a>. The program worked by examining a user's typed comments for keywords. If a keyword is found, a rule that transforms the user's comments is applied, and the resulting sentence is returned. If a keyword is not found, ELIZA responds either with a generic riposte or by repeating one of the earlier comments.<a href="#cite_note-FOOTNOTEWeizenbaum196637-12">[12]</a> In addition, Weizenbaum developed ELIZA to replicate the behaviour of a <a href="/wiki/Person-centered_psychotherapy" class="mw-redirect" title="Person-centered psychotherapy">Rogerian psychotherapist</a>, allowing ELIZA to be "free to assume the pose of knowing almost nothing of the real world".<a href="#cite_note-FOOTNOTEWeizenbaum196642-13">[13]</a> With these techniques, Weizenbaum's program was able to fool some people into believing that they were talking to a real person, with some subjects being "very hard to convince that ELIZA [...] is not human".<a href="#cite_note-FOOTNOTEWeizenbaum196642-13">[13]</a> Thus, ELIZA is claimed by some to be one of the programs (perhaps the first) able to pass the Turing test,<a href="#cite_note-FOOTNOTEWeizenbaum196642-13">[13]</a><a href="#cite_note-FOOTNOTEThomas1995112-14">[14]</a> even though this view is highly contentious (see <a href="#Naïveté_of_interrogators">Naïveté of interrogators</a> below). <a href="/wiki/Kenneth_Colby" title="Kenneth Colby">Kenneth Colby</a> created <a href="/wiki/PARRY" title="PARRY">PARRY</a> in 1972, a program described as "ELIZA with attitude".<a href="#cite_note-FOOTNOTEBoden2006370-15">[15]</a> It attempted to model the behaviour of a <a href="/wiki/Paranoia" title="Paranoia">paranoid</a> <a href="/wiki/Schizophrenic" class="mw-redirect" title="Schizophrenic">schizophrenic</a>, using a similar (if more advanced) approach to that employed by Weizenbaum. To validate the work, PARRY was tested in the early 1970s using a variation of the Turing test. A group of experienced psychiatrists analysed a combination of real patients and computers running PARRY through <a href="/wiki/Teleprinter" title="Teleprinter">teleprinters</a>. Another group of 33 psychiatrists were shown transcripts of the conversations. The two groups were then asked to identify which of the "patients" were human and which were computer programs.<a href="#cite_note-FOOTNOTEColbyHilfWeberKraemer1972220-16">[16]</a> The psychiatrists were able to make the correct identification only 52 percent of the time– a figure consistent with random guessing.<a href="#cite_note-FOOTNOTEColbyHilfWeberKraemer1972220-16">[16]</a> <div class="mw-heading mw-heading3"><h3 id="Eugene_Goostman">Eugene Goostman</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=3" title="Edit section: Eugene Goostman">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Eugene_Goostman" title="Eugene Goostman">Eugene Goostman</a></div> In 2001, in <a href="/wiki/Saint_Petersburg" title="Saint Petersburg">St. Petersburg, Russia</a>, a group of three programmers, the Russian-born Vladimir Veselov, Ukrainian-born Eugene Demchenko, and Russian-born Sergey Ulasen, developed a chatbot called '<a href="/wiki/Eugene_Goostman" title="Eugene Goostman">Eugene Goostman</a>'. On 7 July 2014, it became the first chatbot which appeared to pass the Turing test in an event at the <a href="/wiki/University_of_Reading" title="University of Reading">University of Reading</a> marking the 60th death anniversary of Alan Turing. Thirty-three percent of the event judges thought that Goostman was human; the event organiser <a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Kevin Warwick</a> considered it to have passed Turing's test. It was portrayed as a thirteen year old boy from <a href="/wiki/Odesa" title="Odesa">Odesa, Ukraine</a>, who has a pet guinea pig and a father who is <a href="/wiki/Gynaecology" title="Gynaecology">gynaecologist</a>. The choice of age was intentional so that it induces people who "converse" with him to forgive minor grammatical errors in his responses.<a href="#cite_note-:0-10">[10]</a><a href="#cite_note-17">[17]</a><a href="#cite_note-18">[18]</a> <div class="mw-heading mw-heading3"><h3 id="Google_LaMDA">Google LaMDA</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=4" title="Edit section: Google LaMDA">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/LaMDA" title="LaMDA">LaMDA</a></div> In June 2022 the <a href="/wiki/Google_AI" title="Google AI">Google</a> LaMDA (Language Model for Dialog Applications) chatbot received widespread coverage regarding claims about it having achieved sentience. Initially in an article in <a href="/wiki/The_Economist" title="The Economist">The Economist</a> Google Research Fellow Blaise Agüera y Arcas said the chatbot had demonstrated a degree of understanding of social relationships.<a href="#cite_note-economist_lambda-19">[19]</a> Several days later, Google engineer Blake Lemoine claimed in an interview with the <a href="/wiki/Washington_Post" class="mw-redirect" title="Washington Post">Washington Post</a> that LaMDA had achieved sentience. Lemoine had been placed on leave by Google for internal assertions to this effect. Agüera y Arcas (a Google Vice President) and Jen Gennai (head of Responsible Innovation) had investigated the claims but dismissed them.<a href="#cite_note-washington_post_lambda-20">[20]</a> Lemoine's assertion was roundly rejected by other experts in the field, pointing out that a language model appearing to mimic human conversation does not indicate that any intelligence is present behind it,<a href="#cite_note-fortune_lambda-21">[21]</a> despite seeming to pass the Turing test. Widespread discussion from proponents for and against the claim that LaMDA has reached sentience has sparked discussion across social-media platforms, to include defining the meaning of sentience as well as what it means to be human. <div class="mw-heading mw-heading3"><h3 id="ChatGPT">ChatGPT</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=5" title="Edit section: ChatGPT">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/ChatGPT" title="ChatGPT">ChatGPT</a></div> <a href="/wiki/OpenAI" title="OpenAI">OpenAI</a>'s chatbot, ChatGPT, released in November 2022, is based on <a href="/wiki/GPT-3.5" class="mw-redirect" title="GPT-3.5">GPT-3.5</a> and <a href="/wiki/GPT-4" title="GPT-4">GPT-4</a> <a href="/wiki/Large_language_model" title="Large language model">large language models</a>. Celeste Biever wrote in a Nature article that "ChatGPT broke the Turing test".<a href="#cite_note-22">[22]</a> Stanford researchers reported that ChatGPT passes the test; they found that ChatGPT-4 "passes a rigorous Turing test, diverging from average human behavior chiefly to be more cooperative".<a href="#cite_note-23">[23]</a><a href="#cite_note-24">[24]</a> <div class="mw-heading mw-heading3"><h3 id="Virtual_assistants">Virtual assistants</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=6" title="Edit section: Virtual assistants">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Virtual_assistant" title="Virtual assistant">Virtual assistant</a></div> <a href="/wiki/Virtual_assistant" title="Virtual assistant">Virtual assistants</a> are also AI-powered software agents designed to respond to commands or questions and perform tasks electronically, either with text or verbal commands, so naturally they incorporate chatbot capabilities. Prominent virtual assistants for direct consumer use include <a href="/wiki/Apple_Inc." title="Apple Inc.">Apple</a>'s <a href="/wiki/Siri" title="Siri">Siri</a>, <a href="/wiki/Amazon_Alexa" title="Amazon Alexa">Amazon Alexa</a>, <a href="/wiki/Google_Assistant" title="Google Assistant">Google Assistant</a>, <a href="/wiki/Samsung" title="Samsung">Samsung</a>'s <a href="/wiki/Bixby_(software)" title="Bixby (software)">Bixby</a> and <a href="/wiki/Microsoft_Copilot" title="Microsoft Copilot">Microsoft Copilot</a>.<a href="#cite_note-25">[25]</a><a href="#cite_note-26">[26]</a><a href="#cite_note-27">[27]</a><a href="#cite_note-28">[28]</a> <div class="mw-heading mw-heading3"><h3 id="Malware">Malware</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=7" title="Edit section: Malware">edit</a>]</div> Versions of these programs continue to fool people. "CyberLover", a <a href="/wiki/Malware" title="Malware">malware</a> program, preys on Internet users by convincing them to "reveal information about their identities or to lead them to visit a web site that will deliver malicious content to their computers".<a href="#cite_note-29">[29]</a> The program has emerged as a "Valentine-risk" flirting with people "seeking relationships online in order to collect their personal data".<a href="#cite_note-30">[30]</a> <div class="mw-heading mw-heading2"><h2 id="History">History</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=8" title="Edit section: History">edit</a>]</div> <div class="mw-heading mw-heading3"><h3 id="Philosophical_background">Philosophical background</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=9" title="Edit section: Philosophical background">edit</a>]</div> The question of whether it is possible for machines to think has a long history, which is firmly entrenched in the distinction between <a href="/wiki/Dualism_(philosophy_of_mind)" class="mw-redirect" title="Dualism (philosophy of mind)">dualist</a> and <a href="/wiki/Materialism" title="Materialism">materialist</a> views of the mind. <a href="/wiki/Ren%C3%A9_Descartes" title="René Descartes">René Descartes</a> prefigures aspects of the Turing test in his 1637 <a href="/wiki/Discourse_on_the_Method" title="Discourse on the Method">Discourse on the Method</a> when he writes: <style data-mw-deduplicate="TemplateStyles:r1244412712">.mw-parser-output .templatequote{overflow:hidden;margin:1em 0;padding:0 32px}.mw-parser-output .templatequotecite{line-height:1.5em;text-align:left;margin-top:0}@media(min-width:500px){.mw-parser-output .templatequotecite{padding-left:1.6em}}</style><blockquote class="templatequote">[H]ow many different automata or moving machines could be made by the industry of man ... For we can easily understand a machine's being constituted so that it can utter words, and even emit some responses to action on it of a corporeal kind, which brings about a change in its organs; for instance, if touched in a particular part it may ask what we wish to say to it; if in another part it may exclaim that it is being hurt, and so on. But it never happens that it arranges its speech in various ways, in order to reply appropriately to everything that may be said in its presence, as even the lowest type of man can do.<a href="#cite_note-FOOTNOTEDescartes1996[httpsarchiveorgdetailsdiscourseonmetho0000desc_i4z8page34_34]–35-31">[31]</a></blockquote> Here Descartes notes that <a href="/wiki/Automata" class="mw-redirect" title="Automata">automata</a> are capable of responding to human interactions but argues that such automata cannot respond appropriately to things said in their presence in the way that any human can. Descartes therefore prefigures the Turing test by defining the insufficiency of appropriate linguistic response as that which separates the human from the automaton. Descartes fails to consider the possibility that future automata might be able to overcome such insufficiency, and so does not propose the Turing test as such, even if he prefigures its conceptual framework and criterion. <a href="/wiki/Denis_Diderot" title="Denis Diderot">Denis Diderot</a> formulates in his 1746 book <a href="/wiki/Philosophical_Thoughts" title="Philosophical Thoughts">Pensées philosophiques</a> a Turing-test criterion, though with the important implicit limiting assumption maintained, of the participants being natural living beings, rather than considering created artifacts: <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1244412712"><blockquote class="templatequote">If they find a parrot who could answer to everything, I would claim it to be an intelligent being without hesitation.</blockquote> This does not mean he agrees with this, but that it was already a common argument of <a href="/wiki/Materialists" class="mw-redirect" title="Materialists">materialists</a> at that time. According to dualism, the <a href="/wiki/Mind" title="Mind">mind</a> is <a href="/wiki/Non-physical_entity" title="Non-physical entity">non-physical</a> (or, at the very least, has <a href="/wiki/Property_dualism" title="Property dualism">non-physical properties</a>)<a href="#cite_note-32">[32]</a> and, therefore, cannot be explained in purely physical terms. According to materialism, the mind can be explained physically, which leaves open the possibility of minds that are produced artificially.<a href="#cite_note-33">[33]</a> In 1936, philosopher <a href="/wiki/Alfred_Ayer" class="mw-redirect" title="Alfred Ayer">Alfred Ayer</a> considered the standard philosophical question of <a href="/wiki/Other_minds_problem" class="mw-redirect" title="Other minds problem">other minds</a>: how do we know that other people have the same conscious experiences that we do? In his book, <a href="/wiki/Language,_Truth_and_Logic" class="mw-redirect" title="Language, Truth and Logic">Language, Truth and Logic</a>, Ayer suggested a protocol to distinguish between a conscious man and an unconscious machine: "The only ground I can have for asserting that an object which appears to be conscious is not really a conscious being, but only a dummy or a machine, is that it fails to satisfy one of the empirical tests by which the presence or absence of consciousness is determined".<a href="#cite_note-34">[34]</a> (This suggestion is very similar to the Turing test, but it is not certain that Ayer's popular philosophical classic was familiar to Turing.) In other words, a thing is not conscious if it fails the consciousness test. <div class="mw-heading mw-heading3"><h3 id="Cultural_background">Cultural background</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=10" title="Edit section: Cultural background">edit</a>]</div> A rudimentary idea of the Turing test appears in the 1726 novel <a href="/wiki/Gulliver%27s_Travels" title="Gulliver's Travels">Gulliver's Travels</a> by <a href="/wiki/Jonathan_Swift" title="Jonathan Swift">Jonathan Swift</a>.<a href="#cite_note-35">[35]</a><a href="#cite_note-36">[36]</a> When Gulliver is brought before the king of <a href="/wiki/Brobdingnag" title="Brobdingnag">Brobdingnag</a>, the king thinks at first that Gulliver might be a "a piece of clock-work (which is in that country arrived to a very great perfection) contrived by some ingenious artist". Even when he hears Gulliver speaking, the king still doubts whether Gulliver was taught "a set of words" to make him "sell at a better price". Gulliver tells that only after "he put several other questions to me, and still received rational answers" the king became satisfied that Gulliver was not a machine.<a href="#cite_note-37">[37]</a> Tests where a human judges whether a computer or an alien is intelligent were an established convention in science fiction by the 1940s, and it is likely that Turing would have been aware of these.<a href="#cite_note-:3-38">[38]</a> <a href="/wiki/Stanley_G._Weinbaum" title="Stanley G. Weinbaum">Stanley G. Weinbaum</a>'s "<a href="/wiki/A_Martian_Odyssey" title="A Martian Odyssey">A Martian Odyssey</a>" (1934) provides an example of how nuanced such tests could be.<a href="#cite_note-:3-38">[38]</a> Earlier examples of machines or automatons attempting to pass as human include the <a href="/wiki/Ancient_Greek" title="Ancient Greek">Ancient Greek</a> myth of <a href="/wiki/Pygmalion_(mythology)" title="Pygmalion (mythology)">Pygmalion</a> who creates a sculpture of a woman that is animated by <a href="/wiki/Aphrodite" title="Aphrodite">Aphrodite</a>, <a href="/wiki/Carlo_Collodi" title="Carlo Collodi">Carlo Collodi</a>'s novel <a href="/wiki/The_Adventures_of_Pinocchio" title="The Adventures of Pinocchio">The Adventures of Pinocchio</a>, about a puppet who wants to become a real boy, and <a href="/wiki/E._T._A._Hoffmann" title="E. T. A. Hoffmann">E. T. A. Hoffmann</a>'s 1816 story "<a href="/wiki/The_Sandman_(short_story)" title="The Sandman (short story)">The Sandman</a>," where the protagonist falls in love with an automaton. In all these examples, people are fooled by artificial beings that - up to a point - pass as human.<a href="#cite_note-39">[39]</a> <div class="mw-heading mw-heading3"><h3 id="Alan_Turing_and_the_Imitation_Game">Alan Turing and the Imitation Game</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=11" title="Edit section: Alan Turing and the Imitation Game">edit</a>]</div> Researchers in the United Kingdom had been exploring "machine intelligence" for up to ten years prior to the founding of the field of artificial intelligence (<a href="/wiki/Artificial_intelligence" title="Artificial intelligence">AI</a>) research in 1956.<a href="#cite_note-40">[40]</a> It was a common topic among the members of the <a href="/wiki/Ratio_Club" title="Ratio Club">Ratio Club</a>, an informal group of British <a href="/wiki/Cybernetics" title="Cybernetics">cybernetics</a> and <a href="/wiki/Electronics" title="Electronics">electronics</a> researchers that included Alan Turing.<a href="#cite_note-FOOTNOTEMcCorduck200495-41">[41]</a> Turing, in particular, had been running the notion of machine intelligence since at least 1941<a href="#cite_note-FOOTNOTECopeland20031-42">[42]</a> and one of the earliest-known mentions of "computer intelligence" was made by him in 1947.<a href="#cite_note-FOOTNOTECopeland20032-43">[43]</a> In Turing's report, "Intelligent Machinery,"<a href="#cite_note-44">[44]</a> he investigated "the question of whether or not it is possible for machinery to show intelligent behaviour"<a href="#cite_note-FOOTNOTETuring1948412-45">[45]</a> and, as part of that investigation, proposed what may be considered the forerunner to his later tests: <blockquote>It is not difficult to devise a paper machine which will play a not very bad game of chess.<a href="#cite_note-46">[46]</a> Now get three men A, B and C as subjects for the experiment. A and C are to be rather poor chess players, B is the operator who works the paper machine. ... Two rooms are used with some arrangement for communicating moves, and a game is played between C and either A or the paper machine. C may find it quite difficult to tell which he is playing.&#91;[[Wikipedia:Citing_sources|<span_title="This_citation_requires_a_reference_to_the_specific_page_or_range_of_pages_in_which_the_material_appears.&#32;(May_2011)">page&nbsp;needed]]&#93;_47-0" class="reference"><a href="#cite_note-FOOTNOTETuring1948[[Category:Wikipedia_articles_needing_page_number_citations_from_May_2011]]<sup_class="noprint_Inline-Template_"_style="white-space:nowrap;">&#91;[[Wikipedia:Citing_sources|<span_title="This_citation_requires_a_reference_to_the_specific_page_or_range_of_pages_in_which_the_material_appears.&#32;(May_2011)">page&nbsp;needed]]&#93;-47">[47]</a></blockquote> "<a href="/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence">Computing Machinery and Intelligence</a>" (<a href="#CITEREFTuring1950">1950</a>) was the first published paper by Turing to focus exclusively on machine intelligence. Turing begins the 1950 paper with the claim, "I propose to consider the question 'Can machines think?'"<a href="#cite_note-FOOTNOTETuring1950433-6">[6]</a> As he highlights, the traditional approach to such a question is to start with <a href="/wiki/Definition" title="Definition">definitions</a>, defining both the terms "machine" and "think". Turing chooses not to do so; instead, he replaces the question with a new one, "which is closely related to it and is expressed in relatively unambiguous words".<a href="#cite_note-FOOTNOTETuring1950433-6">[6]</a> In essence he proposes to change the question from "Can machines think?" to "Can machines do what we (as thinking entities) can do?"<a href="#cite_note-FOOTNOTEHarnad20041-48">[48]</a> The advantage of the new question, Turing argues, is that it draws "a fairly sharp line between the physical and intellectual capacities of a man".<a href="#cite_note-FOOTNOTETuring1950434-49">[49]</a> To demonstrate this approach Turing proposes a test inspired by a <a href="/wiki/Party_game" title="Party game">party game</a>, known as the "imitation game", in which a man and a woman go into separate rooms and guests try to tell them apart by writing a series of questions and reading the typewritten answers sent back. In this game, both the man and the woman aim to convince the guests that they are the other. (Huma Shah argues that this two-human version of the game was presented by Turing only to introduce the reader to the machine-human question-answer test.<a href="#cite_note-FOOTNOTEShahWarwick2010a-50">[50]</a>) Turing described his new version of the game as follows: <blockquote>We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?"<a href="#cite_note-FOOTNOTETuring1950434-49">[49]</a></blockquote> Later in the paper, Turing suggests an "equivalent" alternative formulation involving a judge conversing only with a computer and a man.<a href="#cite_note-FOOTNOTETuring1950446-51">[51]</a> While neither of these formulations precisely matches the version of the Turing test that is more generally known today, he proposed a third in 1952. In this version, which Turing discussed in a <a href="/wiki/BBC" title="BBC">BBC</a> radio broadcast, a jury asks questions of a computer and the role of the computer is to make a significant proportion of the jury believe that it is really a man.<a href="#cite_note-52">[52]</a> Turing's paper considered nine putative objections, which include some of the major arguments against <a href="/wiki/Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a> that have been raised in the years since the paper was published (see "<a href="/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence">Computing Machinery and Intelligence</a>").<a href="#cite_note-Turing's_nine_objections-7">[7]</a> <div class="mw-heading mw-heading3"><h3 id="The_Chinese_room">The Chinese room</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=12" title="Edit section: The Chinese room">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a></div> <a href="/wiki/John_Searle" title="John Searle">John Searle</a>'s 1980 paper <a href="/wiki/Minds,_Brains,_and_Programs" class="mw-redirect" title="Minds, Brains, and Programs">Minds, Brains, and Programs</a> proposed the "<a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a>" thought experiment and argued that the Turing test could not be used to determine if a machine could think. Searle noted that software (such as ELIZA) could pass the Turing test simply by manipulating symbols of which they had no understanding. Without understanding, they could not be described as "thinking" in the same sense people did. Therefore, Searle concluded, the Turing test could not prove that machines could think.<a href="#cite_note-FOOTNOTESearle1980-53">[53]</a> Much like the Turing test itself, Searle's argument has been both widely criticised<a href="#cite_note-54">[54]</a> and endorsed.<a href="#cite_note-55">[55]</a> Arguments such as Searle's and others working on the <a href="/wiki/Philosophy_of_mind" title="Philosophy of mind">philosophy of mind</a> sparked off a more intense debate about the nature of intelligence, the possibility of machines with a conscious mind and the value of the Turing test that continued through the 1980s and 1990s.<a href="#cite_note-FOOTNOTESaygin2000479-56">[56]</a> <div class="mw-heading mw-heading3"><h3 id="Loebner_Prize">Loebner Prize</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=13" title="Edit section: Loebner Prize">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Loebner_Prize" title="Loebner Prize">Loebner Prize</a></div> The Loebner Prize provides an annual platform for practical Turing tests with the first competition held in November 1991.<a href="#cite_note-FOOTNOTESundman2003-57">[57]</a> It is underwritten by <a href="/wiki/Hugh_Loebner" title="Hugh Loebner">Hugh Loebner</a>. The Cambridge Center for Behavioral Studies in <a href="/wiki/Massachusetts" title="Massachusetts">Massachusetts</a>, United States, organised the prizes up to and including the 2003 contest. As Loebner described it, one reason the competition was created is to advance the state of AI research, at least in part, because no one had taken steps to implement the Turing test despite 40 years of discussing it.<a href="#cite_note-FOOTNOTELoebner1994-58">[58]</a> The first Loebner Prize competition in 1991 led to a renewed discussion of the viability of the Turing test and the value of pursuing it, in both the popular press<a href="#cite_note-Artificial_Stupidity-59">[59]</a> and academia.<a href="#cite_note-SHAPIRO_SHIEBER-60">[60]</a> The first contest was won by a mindless program with no identifiable intelligence that managed to fool naïve interrogators into making the wrong identification. This highlighted several of the shortcomings of the Turing test (discussed <a href="#Weaknesses">below</a>): The winner won, at least in part, because it was able to "imitate human typing errors";<a href="#cite_note-Artificial_Stupidity-59">[59]</a> the unsophisticated interrogators were easily fooled;<a href="#cite_note-SHAPIRO_SHIEBER-60">[60]</a> and some researchers in AI have been led to feel that the test is merely a distraction from more fruitful research.<a href="#cite_note-FOOTNOTEShieber199477-61">[61]</a> The silver (text only) and gold (audio and visual) prizes have never been won. However, the competition has awarded the bronze medal every year for the computer system that, in the judges' opinions, demonstrates the "most human" conversational behaviour among that year's entries. <a href="/wiki/Artificial_Linguistic_Internet_Computer_Entity" title="Artificial Linguistic Internet Computer Entity">Artificial Linguistic Internet Computer Entity</a> (A.L.I.C.E.) has won the bronze award on three occasions in recent times (2000, 2001, 2004). Learning AI <a href="/wiki/Jabberwacky" title="Jabberwacky">Jabberwacky</a> won in 2005 and 2006. The Loebner Prize tests conversational intelligence; winners are typically <a href="/wiki/Chatterbot" class="mw-redirect" title="Chatterbot">chatterbot</a> programs, or <a href="/wiki/Artificial_Conversational_Entity_(ACE)" class="mw-redirect" title="Artificial Conversational Entity (ACE)">Artificial Conversational Entities (ACE)s</a>. Early Loebner Prize rules restricted conversations: Each entry and hidden-human conversed on a single topic,<a href="#cite_note-saf-62">[62]</a> thus the interrogators were restricted to one line of questioning per entity interaction. The restricted conversation rule was lifted for the 1995 Loebner Prize. Interaction duration between judge and entity has varied in Loebner Prizes. In Loebner 2003, at the University of Surrey, each interrogator was allowed five minutes to interact with an entity, machine or hidden-human. Between 2004 and 2007, the interaction time allowed in Loebner Prizes was more than twenty minutes. <div class="mw-heading mw-heading3"><h3 id="CAPTCHA">CAPTCHA</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=14" title="Edit section: CAPTCHA">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/CAPTCHA" title="CAPTCHA">CAPTCHA</a></div> <a href="/wiki/CAPTCHA" title="CAPTCHA">CAPTCHA</a> (Completely Automated Public Turing test to tell Computers and Humans Apart) is one of the oldest concepts for artificial intelligence. The CAPTCHA system is commonly used online to tell humans and bots apart on the internet. It is based on the Turing test. Displaying distorted letters and numbers, it asks the user to identify the letters and numbers and type them into a field, which bots struggle to do.<a href="#cite_note-:0-10">[10]</a><a href="#cite_note-63">[63]</a> The <a href="/wiki/ReCAPTCHA" title="ReCAPTCHA">reCaptcha</a> is a CAPTCHA system owned by <a href="/wiki/Google" title="Google">Google</a>. The reCaptcha v1 and v2 both used to operate by asking the user to match distorted pictures or identify distorted letters and numbers. The reCaptcha v3 is designed to not interrupt users and run automatically when pages are loaded or buttons are clicked. This "invisible" CAPTCHA verification happens in the background and no challenges appear, which filters out most basic bots.<a href="#cite_note-64">[64]</a><a href="#cite_note-65">[65]</a> <div class="mw-heading mw-heading2"><h2 id="Versions">Versions</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=15" title="Edit section: Versions">edit</a>]</div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:The_Imitation_Game.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/e/ef/The_Imitation_Game.svg/220px-The_Imitation_Game.svg.png" decoding="async" width="220" height="282" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/e/ef/The_Imitation_Game.svg/330px-The_Imitation_Game.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/e/ef/The_Imitation_Game.svg/440px-The_Imitation_Game.svg.png 2x" data-file-width="250" data-file-height="320" /></a><figcaption>The imitation game, as described by Alan Turing in "Computing Machinery and Intelligence". Player C, through a series of written questions, attempts to determine which of the other two players is a man, and which of the two is the woman. Player A, the man, tries to trick player C into making the wrong decision, while player B tries to help player C. Figure adapted from Saygin, 2000.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a></figcaption></figure> Saul Traiger argues that there are at least three primary versions of the Turing test, two of which are offered in "Computing Machinery and Intelligence" and one that he describes as the "Standard Interpretation".<a href="#cite_note-FOOTNOTETraiger2000-66">[66]</a> While there is some debate regarding whether the "Standard Interpretation" is that described by Turing or, instead, based on a misreading of his paper, these three versions are not regarded as equivalent,<a href="#cite_note-FOOTNOTETraiger2000-66">[66]</a> and their strengths and weaknesses are distinct.<a href="#cite_note-FOOTNOTESayginRobertsBeber2008-67">[67]</a> Turing's original article describes a simple party game involving three players. Player A is a man, player B is a woman and player C (who plays the role of the interrogator) is of either gender. In the imitation game, player C is unable to see either player A or player B, and can communicate with them only through written notes. By asking questions of player A and player B, player C tries to determine which of the two is the man and which is the woman. Player A's role is to trick the interrogator into making the wrong decision, while player B attempts to assist the interrogator in making the right one.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a> Turing then asks: <blockquote>"What will happen when a machine takes the part of A in this game? Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman?" These questions replace our original, "Can machines think?"<a href="#cite_note-FOOTNOTETuring1950434-49">[49]</a></blockquote> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Turing_Test_Version_1.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/4/49/Turing_Test_Version_1.svg/220px-Turing_Test_Version_1.svg.png" decoding="async" width="220" height="282" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/4/49/Turing_Test_Version_1.svg/330px-Turing_Test_Version_1.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/4/49/Turing_Test_Version_1.svg/440px-Turing_Test_Version_1.svg.png 2x" data-file-width="250" data-file-height="320" /></a><figcaption>The original imitation game test, in which the player A is replaced with a computer. The computer is now charged with the role of the man, while player B continues to attempt to assist the interrogator. Figure adapted from Saygin, 2000.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a></figcaption></figure> The second version appeared later in Turing's 1950 paper. Similar to the original imitation game test, the role of player A is performed by a computer. However, the role of player B is performed by a man rather than a woman. <blockquote>Let us fix our attention on one particular digital computer C. Is it true that by modifying this computer to have an adequate storage, suitably increasing its speed of action, and providing it with an appropriate programme, C can be made to play satisfactorily the part of A in the imitation game, the part of B being taken by a man?<a href="#cite_note-FOOTNOTETuring1950434-49">[49]</a></blockquote> In this version, both player A (the computer) and player B are trying to trick the interrogator into making an incorrect decision. The standard interpretation is not included in the original paper, but is both accepted and debated. Common understanding has it that the purpose of the Turing test is not specifically to determine whether a computer is able to fool an interrogator into believing that it is a human, but rather whether a computer could imitate a human.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a> While there is some dispute whether this interpretation was intended by Turing, Sterrett believes that it was<a href="#cite_note-FOOTNOTEMoor2003-68">[68]</a> and thus conflates the second version with this one, while others, such as Traiger, do not<a href="#cite_note-FOOTNOTETraiger2000-66">[66]</a> – this has nevertheless led to what can be viewed as the "standard interpretation". In this version, player A is a computer and player B a person of either sex. The role of the interrogator is not to determine which is male and which is female, but which is a computer and which is a human.<a href="#cite_note-FOOTNOTETraiger200099-69">[69]</a> The fundamental issue with the standard interpretation is that the interrogator cannot differentiate which responder is human, and which is machine. There are issues about duration, but the standard interpretation generally considers this limitation as something that should be reasonable. <div class="mw-heading mw-heading2"><h2 id="Interpretations">Interpretations</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=16" title="Edit section: Interpretations">edit</a>]</div> Controversy has arisen over which of the alternative formulations of the test Turing intended.<a href="#cite_note-FOOTNOTEMoor2003-68">[68]</a> Sterrett argues that two distinct tests can be extracted from his 1950 paper and that, <a href="/wiki/Pace_(Latin)" class="mw-redirect" title="Pace (Latin)">pace</a> Turing's remark, they are not equivalent. The test that employs the party game and compares frequencies of success is referred to as the "Original Imitation Game Test", whereas the test consisting of a human judge conversing with a human and a machine is referred to as the "Standard Turing Test", noting that Sterrett equates this with the "standard interpretation" rather than the second version of the imitation game. Sterrett agrees that the standard Turing test (STT) has the problems that its critics cite but feels that, in contrast, the original imitation game test (OIG test) so defined is immune to many of them, due to a crucial difference: Unlike the STT, it does not make similarity to human performance the criterion, even though it employs human performance in setting a criterion for machine intelligence. A man can fail the OIG test, but it is argued that it is a virtue of a test of intelligence that failure indicates a lack of resourcefulness: The OIG test requires the resourcefulness associated with intelligence and not merely "simulation of human conversational behaviour". The general structure of the OIG test could even be used with non-verbal versions of imitation games.<a href="#cite_note-FOOTNOTESterrett2000-70">[70]</a> According to Huma Shah, Turing himself was concerned with whether a machine could think and was providing a simple method to examine this: through human-machine question-answer sessions.<a href="#cite_note-FOOTNOTEShah2011-71">[71]</a> Shah argues the imitation game which Turing described could be practicalized in two different ways: a) one-to-one interrogator-machine test, and b) simultaneous comparison of a machine with a human, both questioned in parallel by an interrogator.<a href="#cite_note-FOOTNOTEShahWarwick2010a-50">[50]</a> Still other writers<a href="#cite_note-72">[72]</a> have interpreted Turing as proposing that the imitation game itself is the test, without specifying how to take into account Turing's statement that the test that he proposed using the party version of the imitation game is based upon a criterion of comparative frequency of success in that imitation game, rather than a capacity to succeed at one round of the game. Some writers argue that the imitation game is best understood by its social aspects. In his 1948 paper, Turing refers to intelligence as an "emotional concept," and notes that <blockquote>The extent to which we regard something as behaving in an intelligent manner is determined as much by our own state of mind and training as by the properties of the object under consideration. If we are able to explain and predict its behaviour or if there seems to be little underlying plan, we have little temptation to imagine intelligence. With the same object therefore it is possible that one man would consider it as intelligent and another would not; the second man would have found out the rules of its behaviour.<a href="#cite_note-FOOTNOTETuring1948431-73">[73]</a></blockquote>Following this remark and similar ones scattered throughout Turing's publications, Diane Proudfoot<a href="#cite_note-FOOTNOTEProudfoot2013398-74">[74]</a> claims that Turing held a response-dependence approach to intelligence, according to which an intelligent (or thinking) entity is one that appears intelligent to an average interrogator. Bernardo Gonçalves shows that although Turing used the rhetoric of introducing his test as a sort of crucial experiment to decide whether machines can be said to think,<a href="#cite_note-FOOTNOTEGonçalves2023a-75">[75]</a> the actual presentation of his test satisfies well-known properties of thought experiments in the modern scientific tradition of Galileo.<a href="#cite_note-FOOTNOTEGonçalves2023b-76">[76]</a> Shlomo Danziger<a href="#cite_note-FOOTNOTEDanziger2022-77">[77]</a> promotes a socio-technological interpretation, according to which Turing saw the imitation game not as an intelligence test but as a technological aspiration - one whose realization would likely involve a change in society's attitude toward machines. According to this reading, Turing's celebrated 50-year prediction - that by the end of the 20th century his test will be passed by some machine - actually consists of two distinguishable predictions. The first is a technological prediction:<blockquote>I believe that in about fifty years' time it will be possible to programme computers ... to make them play the imitation game so well that an average interrogator will not have more than 70% chance of making the right identification after five minutes of questioning.<a href="#cite_note-FOOTNOTETuring1950442-78">[78]</a></blockquote>The second prediction Turing makes is a sociological one:<blockquote>I believe that at the end of the century the use of words and general educated opinion will have altered so much that one will be able to speak of machines thinking without expecting to be contradicted.<a href="#cite_note-FOOTNOTETuring1950442-78">[78]</a></blockquote>Danziger claims further that for Turing, alteration of society's attitude towards machinery is a prerequisite for the existence of intelligent machines: Only when the term "intelligent machine" is no longer seen as an oxymoron the existence of intelligent machines would become logically possible. Saygin has suggested that maybe the original game is a way of proposing a less biased experimental design as it hides the participation of the computer.<a href="#cite_note-79">[79]</a> The imitation game also includes a "social hack" not found in the standard interpretation, as in the game both computer and male human are required to play as pretending to be someone they are not.<a href="#cite_note-80">[80]</a> <div class="mw-heading mw-heading3"><h3 id="Should_the_interrogator_know_about_the_computer?">Should the interrogator know about the computer?</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=17" title="Edit section: Should the interrogator know about the computer?">edit</a>]</div> A crucial piece of any laboratory test is that there should be a control. Turing never makes clear whether the interrogator in his tests is aware that one of the participants is a computer. He states only that player A is to be replaced with a machine, not that player C is to be made aware of this replacement.<a href="#cite_note-FOOTNOTETuring1950434-49">[49]</a> When Colby, FD Hilf, S Weber and AD Kramer tested PARRY, they did so by assuming that the interrogators did not need to know that one or more of those being interviewed was a computer during the interrogation.<a href="#cite_note-FOOTNOTEColbyHilfWeberKraemer1972-81">[81]</a> As Ayse Saygin, Peter Swirski,<a href="#cite_note-FOOTNOTESwirski2000-82">[82]</a> and others have highlighted, this makes a big difference to the implementation and outcome of the test.<a href="#cite_note-FOOTNOTESaygin2000-8">[8]</a> An experimental study looking at <a href="/wiki/Paul_Grice#Conversational_Maxims" title="Paul Grice">Gricean maxim violations</a> using transcripts of Loebner's one-to-one (interrogator-hidden interlocutor) Prize for AI contests between 1994 and 1999, Ayse Saygin found significant differences between the responses of participants who knew and did not know about computers being involved.<a href="#cite_note-FOOTNOTESayginCicekli2002-83">[83]</a> <div class="mw-heading mw-heading2"><h2 id="Strengths">Strengths</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=18" title="Edit section: Strengths">edit</a>]</div> <div class="mw-heading mw-heading3"><h3 id="Tractability_and_simplicity">Tractability and simplicity</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=19" title="Edit section: Tractability and simplicity">edit</a>]</div> The power and appeal of the Turing test derives from its simplicity. The <a href="/wiki/Philosophy_of_mind" title="Philosophy of mind">philosophy of mind</a>, <a href="/wiki/Psychology" title="Psychology">psychology</a>, and modern <a href="/wiki/Neuroscience" title="Neuroscience">neuroscience</a> have been unable to provide definitions of "intelligence" and "thinking" that are sufficiently precise and general to be applied to machines. Without such definitions, the central questions of the <a href="/wiki/Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">philosophy of artificial intelligence</a> cannot be answered. The Turing test, even if imperfect, at least provides something that can actually be measured. As such, it is a pragmatic attempt to answer a difficult philosophical question. <div class="mw-heading mw-heading3"><h3 id="Breadth_of_subject_matter">Breadth of subject matter</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=20" title="Edit section: Breadth of subject matter">edit</a>]</div> The format of the test allows the interrogator to give the machine a wide variety of intellectual tasks. Turing wrote that "the question and answer method seems to be suitable for introducing almost any one of the fields of human endeavour that we wish to include".<a href="#cite_note-FOOTNOTETuring1950under_"Critique_of_the_New_Problem"-84">[84]</a> <a href="/wiki/John_Haugeland" title="John Haugeland">John Haugeland</a> adds that "understanding the words is not enough; you have to understand the topic as well".<a href="#cite_note-FOOTNOTEHaugeland19858-85">[85]</a> To pass a well-designed Turing test, the machine must use <a href="/wiki/Natural_language_processing" title="Natural language processing">natural language</a>, <a href="/wiki/Commonsense_reasoning" title="Commonsense reasoning">reason</a>, have <a href="/wiki/Knowledge_representation" class="mw-redirect" title="Knowledge representation">knowledge</a> and <a href="/wiki/Machine_learning" title="Machine learning">learn</a>. The test can be extended to include video input, as well as a "hatch" through which objects can be passed: this would force the machine to demonstrate skilled use of well designed <a href="/wiki/Computer_vision" title="Computer vision">vision</a> and <a href="/wiki/Robotics" title="Robotics">robotics</a> as well. Together, these represent almost all of the major problems that artificial intelligence research would like to solve.<a href="#cite_note-86">[86]</a> The <a href="/wiki/Feigenbaum_test" class="mw-redirect" title="Feigenbaum test">Feigenbaum test</a> is designed to take advantage of the broad range of topics available to a Turing test. It is a limited form of Turing's question-answer game which compares the machine against the abilities of experts in specific fields such as literature or <a href="/wiki/Chemistry" title="Chemistry">chemistry</a>. <div class="mw-heading mw-heading3"><h3 id="Emphasis_on_emotional_and_aesthetic_intelligence">Emphasis on emotional and aesthetic intelligence</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=21" title="Edit section: Emphasis on emotional and aesthetic intelligence">edit</a>]</div> As a Cambridge honours graduate in mathematics, Turing might have been expected to propose a test of computer intelligence requiring expert knowledge in some highly technical field, and thus anticipating <a href="/wiki/Subject-matter_expert_Turing_test" title="Subject-matter expert Turing test">a more recent approach to the subject</a>. Instead, as already noted, the test which he described in his seminal 1950 paper requires the computer to be able to compete successfully in a common party game, and this by performing as well as the typical man in answering a series of questions so as to pretend convincingly to be the woman contestant. Given the status of human sexual dimorphism as <a href="/wiki/Creation_myths" class="mw-redirect" title="Creation myths">one of the most ancient of subjects</a>, it is thus implicit in the above scenario that the questions to be answered will involve neither specialised factual knowledge nor information processing technique. The challenge for the computer, rather, will be to demonstrate empathy for the role of the female, and to demonstrate as well a characteristic aesthetic sensibility—both of which qualities are on display in this snippet of dialogue which Turing has imagined: <dl><dd>Interrogator: Will X please tell me the length of his or her hair?</dd></dl> <dl><dd>Contestant: My hair is shingled, and the longest strands are about nine inches long.</dd></dl> When Turing does introduce some specialised knowledge into one of his imagined dialogues, the subject is not maths or electronics, but poetry: <dl><dd>Interrogator: In the first line of your sonnet which reads, "Shall I compare thee to a summer's day," would not "a spring day" do as well or better?</dd></dl> <dl><dd>Witness: It wouldn't <a href="/wiki/Scansion" title="Scansion">scan</a>.</dd></dl> <dl><dd>Interrogator: How about "a winter's day". That would scan all right.</dd></dl> <dl><dd>Witness: Yes, but nobody wants to be compared to a winter's day.</dd></dl> Turing thus once again demonstrates his interest in empathy and aesthetic sensitivity as components of an artificial intelligence; and in light of an increasing awareness of the threat from an AI run amok,<a href="#cite_note-87">[87]</a> it has been suggested<a href="#cite_note-88">[88]</a> that this focus perhaps represents a critical intuition on Turing's part, i.e., that emotional and aesthetic intelligence will play a key role in the creation of a "<a href="/wiki/Friendly_AI" class="mw-redirect" title="Friendly AI">friendly AI</a>". It is further noted, however, that whatever inspiration Turing might be able to lend in this direction depends upon the preservation of his original vision, which is to say, further, that the promulgation of a "standard interpretation" of the Turing test—i.e., one which focuses on a discursive intelligence only—must be regarded with some caution. <div class="mw-heading mw-heading2"><h2 id="Weaknesses">Weaknesses</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=22" title="Edit section: Weaknesses">edit</a>]</div> Turing did not explicitly state that the Turing test could be used as a measure of "<a href="/wiki/Intelligence" title="Intelligence">intelligence</a>", or any other human quality. He wanted to provide a clear and understandable alternative to the word "think", which he could then use to reply to criticisms of the possibility of "thinking machines" and to suggest ways that research might move forward. Nevertheless, the Turing test has been proposed as a measure of a machine's "ability to think" or its "intelligence". This proposal has received criticism from both philosophers and computer scientists. The interpretation makes the assumption that an interrogator can determine if a machine is "thinking" by comparing its behaviour with human behaviour. Every element of this assumption has been questioned: the reliability of the interrogator's judgement, the value of comparing the machine with a human, and the value of comparing only behaviour. Because of these and other considerations, some AI researchers have questioned the relevance of the test to their field. <div class="mw-heading mw-heading3"><h3 id="Naïveté_of_interrogators">Naïveté of interrogators</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=23" title="Edit section: Naïveté of interrogators">edit</a>]</div> In practice, the test's results can easily be dominated not by the computer's intelligence, but by the attitudes, skill, or naïveté of the questioner. Numerous experts in the field, including cognitive scientist <a href="/wiki/Gary_Marcus" title="Gary Marcus">Gary Marcus</a>, insist that the Turing test only shows how easy it is to fool humans and is not an indication of machine intelligence.<a href="#cite_note-89">[89]</a> Turing doesn't specify the precise skills and knowledge required by the interrogator in his description of the test, but he did use the term "average interrogator": "[the] average interrogator would not have more than 70 per cent chance of making the right identification after five minutes of questioning".<a href="#cite_note-FOOTNOTETuring1950442-78">[78]</a> Chatterbot programs such as ELIZA have repeatedly fooled unsuspecting people into believing that they are communicating with human beings. In these cases, the "interrogators" are not even aware of the possibility that they are interacting with computers. To successfully appear human, there is no need for the machine to have any intelligence whatsoever and only a superficial resemblance to human behaviour is required. Early Loebner Prize competitions used "unsophisticated" interrogators who were easily fooled by the machines.<a href="#cite_note-SHAPIRO_SHIEBER-60">[60]</a> Since 2004, the Loebner Prize organisers have deployed philosophers, computer scientists, and journalists among the interrogators. Nonetheless, some of these experts have been deceived by the machines.<a href="#cite_note-FOOTNOTEShahWarwick2010j-90">[90]</a> One interesting feature of the Turing test is the frequency of the <a href="/wiki/Confederate_effect" title="Confederate effect">confederate effect</a>, when the confederate (tested) humans are misidentified by the interrogators as machines. It has been suggested that what interrogators expect as human responses is not necessarily typical of humans. As a result, some individuals can be categorised as machines. This can therefore work in favour of a competing machine. The humans are instructed to "act themselves", but sometimes their answers are more like what the interrogator expects a machine to say.<a href="#cite_note-91">[91]</a> This raises the question of how to ensure that the humans are motivated to "act human". <div class="mw-heading mw-heading3"><h3 id="Human_intelligence_vs._intelligence_in_general">Human intelligence vs. intelligence in general</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=24" title="Edit section: Human intelligence vs. intelligence in general">edit</a>]</div> <figure typeof="mw:File/Thumb"><a href="/wiki/File:Weakness_of_Turing_test_1.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/5/57/Weakness_of_Turing_test_1.svg/250px-Weakness_of_Turing_test_1.svg.png" decoding="async" width="250" height="182" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/5/57/Weakness_of_Turing_test_1.svg/375px-Weakness_of_Turing_test_1.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/5/57/Weakness_of_Turing_test_1.svg/500px-Weakness_of_Turing_test_1.svg.png 2x" data-file-width="433" data-file-height="316" /></a><figcaption></figcaption></figure> The Turing test does not directly test whether the computer behaves intelligently. It tests only whether the computer behaves like a human being. Since human behaviour and intelligent behaviour are not exactly the same thing, the test can fail to accurately measure intelligence in two ways: <dl><dt>Some human behaviour is unintelligent</dt> <dd>The Turing test requires that the machine be able to execute all human behaviours, regardless of whether they are intelligent. It even tests for behaviours that may not be considered intelligent at all, such as the susceptibility to insults,<a href="#cite_note-FOOTNOTESayginCicekli2002227–258-92">[92]</a> the temptation to <a href="/wiki/Lie" title="Lie">lie</a> or, simply, a high frequency of <a href="/wiki/Typographical_error" title="Typographical error">typing mistakes</a>. If a machine cannot imitate these unintelligent behaviours in detail it fails the test.</dd></dl> <dl><dd>This objection was raised by <a href="/wiki/The_Economist" title="The Economist">The Economist</a>, in an article entitled "<a href="/wiki/Artificial_stupidity" title="Artificial stupidity">artificial stupidity</a>" published shortly after the first Loebner Prize competition in 1992. The article noted that the first Loebner winner's victory was due, at least in part, to its ability to "imitate human typing errors".<a href="#cite_note-Artificial_Stupidity-59">[59]</a> Turing himself had suggested that programs add errors into their output, so as to be better "players" of the game.<a href="#cite_note-FOOTNOTETuring1950448-93">[93]</a></dd></dl> <dl><dt>Some intelligent behaviour is inhuman</dt> <dd>The Turing test does not test for highly intelligent behaviours, such as the ability to solve difficult problems or come up with original insights. In fact, it specifically requires deception on the part of the machine: if the machine is more intelligent than a human being it must deliberately avoid appearing too intelligent. If it were to solve a computational problem that is practically impossible for a human to solve, then the interrogator would know the program is not human, and the machine would fail the test.</dd></dl> <dl><dd>Because it cannot measure intelligence that is beyond the ability of humans, the test cannot be used to build or evaluate systems that are more intelligent than humans. Because of this, several test alternatives that would be able to evaluate super-intelligent systems have been proposed.<a href="#cite_note-94">[94]</a></dd></dl> <div class="mw-heading mw-heading3"><h3 id="Consciousness_vs._the_simulation_of_consciousness">Consciousness vs. the simulation of consciousness</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=25" title="Edit section: Consciousness vs. the simulation of consciousness">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a></div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">See also: <a href="/wiki/Synthetic_intelligence" title="Synthetic intelligence">Synthetic intelligence</a></div> The Turing test is concerned strictly with how the subject acts – the external behaviour of the machine. In this regard, it takes a <a href="/wiki/Behaviourist" class="mw-redirect" title="Behaviourist">behaviourist</a> or <a href="/wiki/Functionalism_(philosophy_of_mind)" title="Functionalism (philosophy of mind)">functionalist</a> approach to the study of the mind. The example of <a href="/wiki/ELIZA" title="ELIZA">ELIZA</a> suggests that a machine passing the test may be able to simulate human conversational behaviour by following a simple (but large) list of mechanical rules, without thinking or having a mind at all. <a href="/wiki/John_Searle" title="John Searle">John Searle</a> has argued that external behaviour cannot be used to determine if a machine is "actually" thinking or merely "simulating thinking".<a href="#cite_note-FOOTNOTESearle1980-53">[53]</a> His <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a> argument is intended to show that, even if the Turing test is a good operational definition of intelligence, it may not indicate that the machine has a <a href="/wiki/Mind" title="Mind">mind</a>, <a href="/wiki/Consciousness" title="Consciousness">consciousness</a>, or <a href="/wiki/Intentionality" title="Intentionality">intentionality</a>. (Intentionality is a philosophical term for the power of thoughts to be "about" something.) Turing anticipated this line of criticism in his original paper,<a href="#cite_note-95">[95]</a> writing: <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1244412712"><blockquote class="templatequote">I do not wish to give the impression that I think there is no mystery about consciousness. There is, for instance, something of a paradox connected with any attempt to localise it. But I do not think these mysteries necessarily need to be solved before we can answer the question with which we are concerned in this paper.<a href="#cite_note-FOOTNOTETuring1950-96">[96]</a> </blockquote> <div class="mw-heading mw-heading3"><h3 id="Impracticality_and_irrelevance:_the_Turing_test_and_AI_research">Impracticality and irrelevance: the Turing test and AI research</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=26" title="Edit section: Impracticality and irrelevance: the Turing test and AI research">edit</a>]</div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Sam_Harris_takes_the_Turing_Test_(51169748740).png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/4/49/Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png/220px-Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png" decoding="async" width="220" height="137" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/4/49/Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png/330px-Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/4/49/Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png/440px-Sam_Harris_takes_the_Turing_Test_%2851169748740%29.png 2x" data-file-width="3034" data-file-height="1888" /></a><figcaption>GPT-3 talkbot attempt</figcaption></figure> Mainstream AI researchers argue that trying to pass the Turing test is merely a distraction from more fruitful research.<a href="#cite_note-FOOTNOTEShieber199477-61">[61]</a> Indeed, the Turing test is not an active focus of much academic or commercial effort—as <a href="/wiki/Stuart_J._Russell" title="Stuart J. Russell">Stuart Russell</a> and <a href="/wiki/Peter_Norvig" title="Peter Norvig">Peter Norvig</a> write: "AI researchers have devoted little attention to passing the Turing test".<a href="#cite_note-FOOTNOTERussellNorvig20033-97">[97]</a> There are several reasons. First, there are easier ways to test their programs. Most current research in AI-related fields is aimed at modest and specific goals, such as <a href="/wiki/Object_recognition" class="mw-redirect" title="Object recognition">object recognition</a> or <a href="/wiki/Logistics" title="Logistics">logistics</a>. To test the intelligence of the programs that solve these problems, AI researchers simply give them the task directly. Stuart Russell and Peter Norvig suggest an analogy with the <a href="/wiki/History_of_flight" class="mw-redirect" title="History of flight">history of flight</a>: Planes are tested by how well they fly, not by comparing them to birds. "<a href="/wiki/Aeronautics" title="Aeronautics">Aeronautical engineering</a> texts," they write, "do not define the goal of their field as 'making machines that fly so exactly like <a href="/wiki/Pigeon" class="mw-redirect" title="Pigeon">pigeons</a> that they can fool other pigeons.'"<a href="#cite_note-FOOTNOTERussellNorvig20033-97">[97]</a> Second, creating lifelike simulations of human beings is a difficult problem on its own that does not need to be solved to achieve the basic goals of AI research. Believable human characters may be interesting in a work of art, a <a href="/wiki/Video_game" title="Video game">game</a>, or a sophisticated <a href="/wiki/User_interface" title="User interface">user interface</a>, but they are not part of the science of creating intelligent machines, that is, machines that solve problems using intelligence. Turing did not intend for his idea to be used to test the intelligence of programs—he wanted to provide a clear and understandable example to aid in the discussion of the <a href="/wiki/Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">philosophy of artificial intelligence</a>.<a href="#cite_note-98">[98]</a> <a href="/wiki/John_McCarthy_(computer_scientist)" title="John McCarthy (computer scientist)">John McCarthy</a> argues that we should not be surprised that a philosophical idea turns out to be useless for practical applications. He observes that the philosophy of AI is "unlikely to have any more effect on the practice of AI research than philosophy of science generally has on the practice of science".<a href="#cite_note-99">[99]</a><a href="#cite_note-100">[100]</a> <div class="mw-heading mw-heading3"><h3 id="The_language-centric_objection">The language-centric objection</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=27" title="Edit section: The language-centric objection">edit</a>]</div> Another well known objection raised towards the Turing test concerns its exclusive focus on linguistic behaviour (i.e. it is only a "language-based" experiment, while all the other cognitive faculties are not tested). This drawback downsizes the role of other modality-specific "intelligent abilities" concerning human beings that the psychologist Howard Gardner, in his "<a href="/wiki/Theory_of_multiple_intelligences" title="Theory of multiple intelligences">multiple intelligence theory</a>", proposes to consider (verbal-linguistic abilities are only one of those).<a href="#cite_note-101">[101]</a> <div class="mw-heading mw-heading3"><h3 id="Silence">Silence</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=28" title="Edit section: Silence">edit</a>]</div> A critical aspect of the Turing test is that a machine must give itself away as being a machine by its utterances. An interrogator must then make the "right identification" by correctly identifying the machine as being just that. If, however, a machine remains silent during a conversation, then it is not possible for an interrogator to accurately identify the machine other than by means of a calculated guess.<a href="#cite_note-102">[102]</a> Even taking into account a parallel/hidden human as part of the test may not help the situation as humans can often be misidentified as being a machine.<a href="#cite_note-103">[103]</a> <div class="mw-heading mw-heading3"><h3 id="The_Turing_Trap">The Turing Trap</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=29" title="Edit section: The Turing Trap">edit</a>]</div> By focusing on imitating humans, rather than augmenting or extending human capabilities, the Turing Test risks directing research and implementation toward technologies that substitute for humans and thereby drive down wages and income for workers. As they lose economic power, these workers may also lose political power, making it more difficult for them to change the allocation of wealth and income. This can trap them in a bad equilibrium. Erik Brynjolfsson has called this "The Turing Trap"<a href="#cite_note-104">[104]</a> and argued that there are currently excess incentives for creating machines that imitate rather than augment humans. <div class="mw-heading mw-heading2"><h2 id="Variations">Variations</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=30" title="Edit section: Variations">edit</a>]</div> Numerous other versions of the Turing test, including those expounded above, have been raised through the years. <div class="mw-heading mw-heading3"><h3 id="Reverse_Turing_test_and_CAPTCHA">Reverse Turing test and CAPTCHA</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=31" title="Edit section: Reverse Turing test and CAPTCHA">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main articles: <a href="/wiki/Reverse_Turing_test" title="Reverse Turing test">Reverse Turing test</a> and <a href="/wiki/CAPTCHA" title="CAPTCHA">CAPTCHA</a></div> A modification of the Turing test wherein the objective of one or more of the roles have been reversed between machines and humans is termed a reverse Turing test. An example is implied in the work of psychoanalyst <a href="/wiki/Wilfred_Bion" title="Wilfred Bion">Wilfred Bion</a>,<a href="#cite_note-FOOTNOTEBion1979-105">[105]</a> who was particularly fascinated by the "storm" that resulted from the encounter of one mind by another. In his 2000 book,<a href="#cite_note-FOOTNOTESwirski2000-82">[82]</a> among several other original points with regard to the Turing test, literary scholar <a href="/wiki/Peter_Swirski" title="Peter Swirski">Peter Swirski</a> discussed in detail the idea of what he termed the Swirski test—essentially the reverse Turing test. He pointed out that it overcomes most if not all standard objections levelled at the standard version. Carrying this idea forward, <a href="/wiki/R._D._Hinshelwood" title="R. D. Hinshelwood">R. D. Hinshelwood</a><a href="#cite_note-FOOTNOTEHinshelwood2001-106">[106]</a> described the mind as a "mind recognizing apparatus". The challenge would be for the computer to be able to determine if it were interacting with a human or another computer. This is an extension of the original question that Turing attempted to answer but would, perhaps, offer a high enough standard to define a machine that could "think" in a way that we typically define as characteristically human. <a href="/wiki/CAPTCHA" title="CAPTCHA">CAPTCHA</a> is a form of reverse Turing test. Before being allowed to perform some action on a website, the user is presented with alphanumerical characters in a distorted graphic image and asked to type them out. This is intended to prevent automated systems from being used to abuse the site. The rationale is that software sufficiently sophisticated to read and reproduce the distorted image accurately does not exist (or is not available to the average user), so any system able to do so is likely to be a human. Software that could reverse CAPTCHA with some accuracy by analysing patterns in the generating engine started being developed soon after the creation of CAPTCHA.<a href="#cite_note-107">[107]</a> In 2013, researchers at <a href="/wiki/Vicarious_(company)" title="Vicarious (company)">Vicarious</a> announced that they had developed a system to solve CAPTCHA challenges from <a href="/wiki/Google" title="Google">Google</a>, <a href="/wiki/Yahoo!" class="mw-redirect" title="Yahoo!">Yahoo!</a>, and <a href="/wiki/PayPal" title="PayPal">PayPal</a> up to 90% of the time.<a href="#cite_note-108">[108]</a> In 2014, Google engineers demonstrated a system that could defeat CAPTCHA challenges with 99.8% accuracy.<a href="#cite_note-109">[109]</a> In 2015, <a href="/wiki/Shuman_Ghosemajumder" title="Shuman Ghosemajumder">Shuman Ghosemajumder</a>, former <a href="/wiki/Click_fraud" title="Click fraud">click fraud</a> czar of Google, stated that there were <a href="/wiki/Cybercrime" title="Cybercrime">cybercriminal</a> sites that would defeat CAPTCHA challenges for a fee, to enable various forms of fraud.<a href="#cite_note-110">[110]</a> <div class="mw-heading mw-heading3"><h3 id="Distinguishing_accurate_use_of_language_from_actual_understanding">Distinguishing accurate use of language from actual understanding</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=32" title="Edit section: Distinguishing accurate use of language from actual understanding">edit</a>]</div> A further variation is motivated by the concern that modern Natural Language Processing prove to be highly successful in generating text on the basis of a huge text corpus and could eventually pass the Turing test simply by manipulating words and sentences that have been used in the initial training of the model. Since the interrogator has no precise understanding of the training data, the model might simply be returning sentences that exist in similar fashion in the enormous amount of training data. For this reason, <a href="/w/index.php?title=Arthur_Schwaninger&action=edit&redlink=1" class="new" title="Arthur Schwaninger (page does not exist)">Arthur Schwaninger</a> proposes a variation of the Turing test that can distinguish between systems that are only capable of using language and systems that understand language. He proposes a test in which the machine is confronted with philosophical questions that do not depend on any prior knowledge and yet require self-reflection to be answered appropriately.<a href="#cite_note-111">[111]</a> <div class="mw-heading mw-heading3"><h3 id="Subject_matter_expert_Turing_test">Subject matter expert Turing test</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=33" title="Edit section: Subject matter expert Turing test">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Subject-matter_expert_Turing_test" title="Subject-matter expert Turing test">Subject-matter expert Turing test</a></div> Another variation is described as the <a href="/wiki/Subject-matter_expert" title="Subject-matter expert">subject-matter expert</a> Turing test, where a machine's response cannot be distinguished from an expert in a given field. This is also known as a "Feigenbaum test" and was proposed by <a href="/wiki/Edward_Feigenbaum" title="Edward Feigenbaum">Edward Feigenbaum</a> in a 2003 paper.<a href="#cite_note-112">[112]</a> <div class="mw-heading mw-heading3"><h3 id=""Low-level"_cognition_test">"Low-level" cognition test</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=34" title="Edit section: "Low-level" cognition test">edit</a>]</div> <a href="/wiki/Robert_M._French" title="Robert M. French">Robert French</a> (1990) makes the case that an interrogator can distinguish human and non-human interlocutors by posing questions that reveal the low-level (i.e., unconscious) processes of human cognition, as studied by <a href="/wiki/Cognitive_science" title="Cognitive science">cognitive science</a>. Such questions reveal the precise details of the human embodiment of thought and can unmask a computer unless it experiences the world as humans do.<a href="#cite_note-113">[113]</a> <div class="mw-heading mw-heading3"><h3 id="Total_Turing_test">Total Turing test</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=35" title="Edit section: Total Turing test">edit</a>]</div> The "Total Turing test"<a href="#cite_note-The_Turing_Test-4">[4]</a> variation of the Turing test, proposed by cognitive scientist <a href="/wiki/Stevan_Harnad" title="Stevan Harnad">Stevan Harnad</a>,<a href="#cite_note-114">[114]</a> adds two further requirements to the traditional Turing test. The interrogator can also test the perceptual abilities of the subject (requiring <a href="/wiki/Computer_vision" title="Computer vision">computer vision</a>) and the subject's ability to manipulate objects (requiring <a href="/wiki/Robotics" title="Robotics">robotics</a>).<a href="#cite_note-FOOTNOTERussellNorvig20103-115">[115]</a> <div class="mw-heading mw-heading3"><h3 id="Electronic_health_records">Electronic health records</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=36" title="Edit section: Electronic health records">edit</a>]</div> A letter published in Communications of the ACM<a href="#cite_note-116">[116]</a> describes the concept of generating a synthetic patient population and proposes a variation of Turing test to assess the difference between synthetic and real patients. The letter states: "In the EHR context, though a human physician can readily distinguish between synthetically generated and real live human patients, could a machine be given the intelligence to make such a determination on its own?" and further the letter states: "Before synthetic patient identities become a public health problem, the legitimate EHR market might benefit from applying Turing Test-like techniques to ensure greater data reliability and diagnostic value. Any new techniques must thus consider patients' heterogeneity and are likely to have greater complexity than the Allen eighth-grade-science-test is able to grade". <div class="mw-heading mw-heading3"><h3 id="Minimum_intelligent_signal_test">Minimum intelligent signal test</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=37" title="Edit section: Minimum intelligent signal test">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="/wiki/Minimum_intelligent_signal_test" title="Minimum intelligent signal test">Minimum intelligent signal test</a></div> The minimum intelligent signal test was proposed by <a href="/wiki/Chris_McKinstry" title="Chris McKinstry">Chris McKinstry</a> as "the maximum abstraction of the Turing test",<a href="#cite_note-117">[117]</a> in which only binary responses (true/false or yes/no) are permitted, to focus only on the capacity for thought. It eliminates text chat problems like <a href="#Naïveté_of_interrogators">anthropomorphism bias</a>, and does not require emulation of <a href="#Human_intelligence_vs._intelligence_in_general">unintelligent human behaviour</a>, allowing for systems that exceed human intelligence. The questions must each stand on their own, however, making it more like an <a href="/wiki/IQ_test" class="mw-redirect" title="IQ test">IQ test</a> than an interrogation. It is typically used to gather statistical data against which the performance of artificial intelligence programs may be measured.<a href="#cite_note-118">[118]</a> <div class="mw-heading mw-heading3"><h3 id="Hutter_Prize">Hutter Prize</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=38" title="Edit section: Hutter Prize">edit</a>]</div> The organisers of the <a href="/wiki/Hutter_Prize" title="Hutter Prize">Hutter Prize</a> believe that compressing natural language text is a hard AI problem, equivalent to passing the Turing test. The data compression test has some advantages over most versions and variations of a Turing test, including:[<a href="/wiki/Wikipedia:Citation_needed" title="Wikipedia:Citation needed">citation needed</a>] <ul><li>It gives a single number that can be directly used to compare which of two machines is "more intelligent".</li> <li>It does not require the computer to lie to the judge</li></ul> The main disadvantages of using data compression as a test are: <ul><li>It is not possible to test humans this way.</li> <li>It is unknown what particular "score" on this test—if any—is equivalent to passing a human-level Turing test.</li></ul> <div class="mw-heading mw-heading3"><h3 id="Other_tests_based_on_compression_or_Kolmogorov_complexity">Other tests based on compression or Kolmogorov complexity</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=39" title="Edit section: Other tests based on compression or Kolmogorov complexity">edit</a>]</div> A related approach to Hutter's prize which appeared much earlier in the late 1990s is the inclusion of compression problems in an extended Turing test.<a href="#cite_note-119">[119]</a> or by tests which are completely derived from <a href="/wiki/Kolmogorov_complexity" title="Kolmogorov complexity">Kolmogorov complexity</a>.<a href="#cite_note-120">[120]</a> Other related tests in this line are presented by Hernandez-Orallo and Dowe.<a href="#cite_note-FOOTNOTEHernandez-OralloDowe2010-121">[121]</a> Algorithmic IQ, or AIQ for short, is an attempt to convert the theoretical Universal Intelligence Measure from Legg and Hutter (based on <a href="/wiki/Solomonoff%27s_theory_of_inductive_inference" title="Solomonoff's theory of inductive inference">Solomonoff's inductive inference</a>) into a working practical test of machine intelligence.<a href="#cite_note-122">[122]</a> Two major advantages of some of these tests are their applicability to nonhuman intelligences and their absence of a requirement for human testers. <div class="mw-heading mw-heading3"><h3 id="Ebert_test">Ebert test</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=40" title="Edit section: Ebert test">edit</a>]</div> The Turing test inspired the <a href="/wiki/Ebert_test" title="Ebert test">Ebert test</a> proposed in 2011 by film critic <a href="/wiki/Roger_Ebert" title="Roger Ebert">Roger Ebert</a> which is a test whether a computer-based <a href="/wiki/Speech_synthesis" title="Speech synthesis">synthesised voice</a> has sufficient skill in terms of intonations, inflections, timing and so forth, to make people laugh.<a href="#cite_note-twsL37-123">[123]</a> <div class="mw-heading mw-heading3"><h3 id="Social_Turing_game">Social Turing game</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=41" title="Edit section: Social Turing game">edit</a>]</div> Taking advantage of <a href="/wiki/Large_language_model" title="Large language model">large language models</a>, in 2023 the research company <a href="/wiki/AI21_Labs" title="AI21 Labs">AI21 Labs</a> created an online social experiment titled "Human or Not?"<a href="#cite_note-124">[124]</a><a href="#cite_note-125">[125]</a> It was played more than 10 million times by more than 2 million people.<a href="#cite_note-126">[126]</a> It is the biggest Turing-style experiment to that date. The results showed that 32% of people could not distinguish between humans and machines.<a href="#cite_note-127">[127]</a><a href="#cite_note-128">[128]</a> <div class="mw-heading mw-heading2"><h2 id="Conferences">Conferences</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=42" title="Edit section: Conferences">edit</a>]</div> <div class="mw-heading mw-heading3"><h3 id="Turing_Colloquium">Turing Colloquium</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=43" title="Edit section: Turing Colloquium">edit</a>]</div> 1990 marked the fortieth anniversary of the first publication of Turing's "Computing Machinery and Intelligence" paper, and saw renewed interest in the test. Two significant events occurred in that year: the first was the Turing Colloquium, which was held at the <a href="/wiki/University_of_Sussex" title="University of Sussex">University of Sussex</a> in April, and brought together academics and researchers from a wide variety of disciplines to discuss the Turing test in terms of its past, present, and future; the second was the formation of the annual <a href="/wiki/Loebner_Prize" title="Loebner Prize">Loebner Prize</a> competition. <a href="/wiki/Blay_Whitby" title="Blay Whitby">Blay Whitby</a> lists four major turning points in the history of the Turing test – the publication of "Computing Machinery and Intelligence" in 1950, the announcement of <a href="/wiki/Joseph_Weizenbaum" title="Joseph Weizenbaum">Joseph Weizenbaum</a>'s <a href="/wiki/ELIZA" title="ELIZA">ELIZA</a> in 1966, <a href="/wiki/Kenneth_Colby" title="Kenneth Colby">Kenneth Colby</a>'s creation of <a href="/wiki/PARRY" title="PARRY">PARRY</a>, which was first described in 1972, and the Turing Colloquium in 1990.<a href="#cite_note-FOOTNOTEWhitby199653-129">[129]</a> <div class="mw-heading mw-heading3"><h3 id="2008_AISB_Symposium">2008 AISB Symposium</h3>[<a href="/w/index.php?title=Turing_test&action=edit&section=44" title="Edit section: 2008 AISB Symposium">edit</a>]</div> In parallel to the 2008 <a href="/wiki/Loebner_Prize" title="Loebner Prize">Loebner Prize</a> held at the <a href="/wiki/University_of_Reading" title="University of Reading">University of Reading</a>,<a href="#cite_note-130">[130]</a> the <a href="/wiki/Society_for_the_Study_of_Artificial_Intelligence_and_the_Simulation_of_Behaviour" title="Society for the Study of Artificial Intelligence and the Simulation of Behaviour">Society for the Study of Artificial Intelligence and the Simulation of Behaviour</a> (AISB), hosted a one-day symposium to discuss the Turing test, organised by <a href="/w/index.php?title=John_Barnden&action=edit&redlink=1" class="new" title="John Barnden (page does not exist)">John Barnden</a>, <a href="/wiki/Mark_Bishop" title="Mark Bishop">Mark Bishop</a>, <a href="/w/index.php?title=Huma_Shah&action=edit&redlink=1" class="new" title="Huma Shah (page does not exist)">Huma Shah</a> and <a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Kevin Warwick</a>.<a href="#cite_note-131">[131]</a> The speakers included the Royal Institution's Director <a href="/wiki/Susan_Greenfield,_Baroness_Greenfield" title="Susan Greenfield, Baroness Greenfield">Baroness Susan Greenfield</a>, <a href="/wiki/Selmer_Bringsjord" title="Selmer Bringsjord">Selmer Bringsjord</a>, Turing's biographer <a href="/wiki/Andrew_Hodges" title="Andrew Hodges">Andrew Hodges</a>, and consciousness scientist <a href="/wiki/Owen_Holland_(academic)" title="Owen Holland (academic)">Owen Holland</a>. No agreement emerged for a canonical Turing test, though Bringsjord expressed that a sizeable prize would result in the Turing test being passed sooner. <div class="mw-heading mw-heading2"><h2 id="See_also">See also</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=45" title="Edit section: See also">edit</a>]</div> <style data-mw-deduplicate="TemplateStyles:r1184024115">.mw-parser-output .div-col{margin-top:0.3em;column-width:30em}.mw-parser-output .div-col-small{font-size:90%}.mw-parser-output .div-col-rules{column-rule:1px solid #aaa}.mw-parser-output .div-col dl,.mw-parser-output .div-col ol,.mw-parser-output .div-col ul{margin-top:0}.mw-parser-output .div-col li,.mw-parser-output .div-col dd{page-break-inside:avoid;break-inside:avoid-column}</style><div class="div-col" style="column-width: 20em;"> <ul><li><a href="/wiki/Natural_language_processing" title="Natural language processing">Natural language processing</a></li> <li><a href="/wiki/Artificial_intelligence_in_fiction" title="Artificial intelligence in fiction">Artificial intelligence in fiction</a></li> <li><a href="/wiki/Blindsight" title="Blindsight">Blindsight</a></li> <li><a href="/wiki/Causality" title="Causality">Causality</a></li> <li><a href="/wiki/Chatbot" title="Chatbot">Chatbot</a></li> <li><a href="/wiki/ChatGPT" title="ChatGPT">ChatGPT</a></li> <li><a href="/wiki/Computer_game_bot_Turing_Test" class="mw-redirect" title="Computer game bot Turing Test">Computer game bot Turing Test</a></li> <li><a href="/wiki/Dead_Internet_theory" title="Dead Internet theory">Dead Internet theory</a></li> <li><a href="/wiki/Explanation" title="Explanation">Explanation</a></li> <li><a href="/wiki/Explanatory_gap" title="Explanatory gap">Explanatory gap</a></li> <li><a href="/wiki/Functionalism_(philosophy_of_mind)" title="Functionalism (philosophy of mind)">Functionalism</a></li> <li><a href="/wiki/Graphics_Turing_Test" class="mw-redirect" title="Graphics Turing Test">Graphics Turing Test</a></li> <li><a href="/wiki/Ex_Machina_(film)" title="Ex Machina (film)">Ex Machina</a> (film)</li> <li><a href="/wiki/Hard_problem_of_consciousness" title="Hard problem of consciousness">Hard problem of consciousness</a></li> <li><a href="/wiki/List_of_things_named_after_Alan_Turing" title="List of things named after Alan Turing">List of things named after Alan Turing</a></li> <li><a href="/wiki/Mark_V._Shaney" title="Mark V. Shaney">Mark V. Shaney</a> (Usenet bot)</li> <li><a href="/wiki/Mind-body_problem" class="mw-redirect" title="Mind-body problem">Mind-body problem</a></li> <li><a href="/wiki/Mirror_neuron" title="Mirror neuron">Mirror neuron</a></li> <li><a href="/wiki/Philosophical_zombie" title="Philosophical zombie">Philosophical zombie</a></li> <li><a href="/wiki/Problem_of_other_minds" title="Problem of other minds">Problem of other minds</a></li> <li><a href="/wiki/Reverse_engineering" title="Reverse engineering">Reverse engineering</a></li> <li><a href="/wiki/Sentience" title="Sentience">Sentience</a></li> <li><a href="/wiki/Simulated_reality" title="Simulated reality">Simulated reality</a></li> <li><a href="/wiki/Social_bot" title="Social bot">Social bot</a></li> <li><a href="/wiki/Technological_singularity" title="Technological singularity">Technological singularity</a></li> <li><a href="/wiki/Theory_of_mind" title="Theory of mind">Theory of mind</a></li> <li><a href="/wiki/Uncanny_valley" title="Uncanny valley">Uncanny valley</a></li> <li><a href="/wiki/Voight-Kampff_machine" class="mw-redirect" title="Voight-Kampff machine">Voight-Kampff machine</a> (fictitious Turing test from Blade Runner)</li> <li><a href="/wiki/Winograd_Schema_Challenge" class="mw-redirect" title="Winograd Schema Challenge">Winograd Schema Challenge</a></li> <li><a href="/wiki/SHRDLU" title="SHRDLU">SHRDLU</a></li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="Notes">Notes</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=46" title="Edit section: Notes">edit</a>]</div> <style data-mw-deduplicate="TemplateStyles:r1239543626">.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}</style><div class="reflist reflist-columns references-column-width" style="column-width: 30em;"> <ol class="references"> <li id="cite_note-1"><a href="#cite_ref-1">^</a> Image adapted from <a href="#CITEREFSaygin2000">Saygin 2000</a> </li> <li id="cite_note-Turing-1950-2">^ <a href="#cite_ref-Turing-1950_2-0">a</a> <a href="#cite_ref-Turing-1950_2-1">b</a> (<a href="#CITEREFTuring1950">Turing 1950</a>). Turing wrote about the ‘imitation game’ centrally and extensively throughout his 1950 text, but apparently retired the term thereafter. He referred to ‘[his] test’ four times—three times in pp. 446–447 and once on p. 454. He also referred to it as an ‘experiment’—once on p. 436, twice on p. 455, and twice again on p. 457—and used the term ‘viva voce’ (p. 446), see <a href="#CITEREFGonçalves2023b">Gonçalves (2023b</a>, p. 2). See also <a href="#Versions">#Versions</a>, below. Turing gives a more precise version of the question later in the paper: "[T]hese questions [are] equivalent to this, 'Let us fix our attention on one particular digital computer C. Is it true that by modifying this computer to have an adequate storage, suitably increasing its speed of action, and providing it with an appropriate programme, C can be made to play satisfactorily the part of A in the imitation game, the part of B being taken by a man?'" (<a href="#CITEREFTuring1950">Turing 1950</a>, p. 442) </li> <li id="cite_note-3"><a href="#cite_ref-3">^</a> Turing originally suggested a <a href="/wiki/Teleprinter" title="Teleprinter">teleprinter</a>, one of the few text-only communication systems available in 1950. (<a href="#CITEREFTuring1950">Turing 1950</a>, p. 433) </li> <li id="cite_note-The_Turing_Test-4">^ <a href="#cite_ref-The_Turing_Test_4-0">a</a> <a href="#cite_ref-The_Turing_Test_4-1">b</a> Oppy, Graham & Dowe, David (2011) <a rel="nofollow" class="external text" href="http://www.illc.uva.nl/~seop/entries/turing-test/">The Turing Test</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20120320101053/http://www.illc.uva.nl/~seop/entries/turing-test/">Archived</a> 20 March 2012 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>. Stanford Encyclopedia of Philosophy. </li> <li id="cite_note-5"><a href="#cite_ref-5">^</a> <style data-mw-deduplicate="TemplateStyles:r1238218222">.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}</style><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.turing.org.uk/scrapbook/test.html">"The Turing Test, 1950"</a>. turing.org.uk. The Alan Turing Internet Scrapbook. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190403170058/https://www.turing.org.uk/scrapbook/test.html">Archived</a> from the original on 3 April 2019. Retrieved 23 April 2015.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=turing.org.uk&rft.atitle=The+Turing+Test%2C+1950&rft_id=http%3A%2F%2Fwww.turing.org.uk%2Fscrapbook%2Ftest.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTETuring1950433-6">^ <a href="#cite_ref-FOOTNOTETuring1950433_6-0">a</a> <a href="#cite_ref-FOOTNOTETuring1950433_6-1">b</a> <a href="#cite_ref-FOOTNOTETuring1950433_6-2">c</a> <a href="#CITEREFTuring1950">Turing 1950</a>, p. 433. </li> <li id="cite_note-Turing's_nine_objections-7">^ <a href="#cite_ref-Turing's_nine_objections_7-0">a</a> <a href="#cite_ref-Turing's_nine_objections_7-1">b</a> <a href="#CITEREFTuring1950">Turing 1950</a>, pp. 442–454 and see <a href="#CITEREFRussellNorvig2003">Russell & Norvig (2003</a>, p. 948), where they comment, "Turing examined a wide variety of possible objections to the idea of intelligent machines, including virtually all of those that have been raised in the half century since his paper appeared." </li> <li id="cite_note-FOOTNOTESaygin2000-8">^ <a href="#cite_ref-FOOTNOTESaygin2000_8-0">a</a> <a href="#cite_ref-FOOTNOTESaygin2000_8-1">b</a> <a href="#cite_ref-FOOTNOTESaygin2000_8-2">c</a> <a href="#cite_ref-FOOTNOTESaygin2000_8-3">d</a> <a href="#cite_ref-FOOTNOTESaygin2000_8-4">e</a> <a href="#cite_ref-FOOTNOTESaygin2000_8-5">f</a> <a href="#CITEREFSaygin2000">Saygin 2000</a>. </li> <li id="cite_note-FOOTNOTERussellNorvig20032–3,_948-9"><a href="#cite_ref-FOOTNOTERussellNorvig20032–3,_948_9-0">^</a> <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 2–3, 948. </li> <li id="cite_note-:0-10">^ <a href="#cite_ref-:0_10-0">a</a> <a href="#cite_ref-:0_10-1">b</a> <a href="#cite_ref-:0_10-2">c</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFParsonsDixon2016" class="citation book cs1">Parsons, Paul; Dixon, Gail (2016). 50 Ideas You Really Need to Know: Science. London: <a href="/wiki/Quercus" class="mw-redirect" title="Quercus">Quercus</a>. p. 65. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-78429-614-8" title="Special:BookSources/978-1-78429-614-8"><bdi>978-1-78429-614-8</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=50+Ideas+You+Really+Need+to+Know%3A+Science&rft.place=London&rft.pages=65&rft.pub=Quercus&rft.date=2016&rft.isbn=978-1-78429-614-8&rft.aulast=Parsons&rft.aufirst=Paul&rft.au=Dixon%2C+Gail&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-11"><a href="#cite_ref-11">^</a> Oxford English Dictionary, "chatbot", 3rd ed., Oxford University Press, 2010. Accessed September 26, 2024. <a rel="nofollow" class="external free" href="https://www.oxfordlearnersdictionaries.com/definition/english/chatbot?q=chatbot">https://www.oxfordlearnersdictionaries.com/definition/english/chatbot?q=chatbot</a>. </li> <li id="cite_note-FOOTNOTEWeizenbaum196637-12"><a href="#cite_ref-FOOTNOTEWeizenbaum196637_12-0">^</a> <a href="#CITEREFWeizenbaum1966">Weizenbaum 1966</a>, p. 37. </li> <li id="cite_note-FOOTNOTEWeizenbaum196642-13">^ <a href="#cite_ref-FOOTNOTEWeizenbaum196642_13-0">a</a> <a href="#cite_ref-FOOTNOTEWeizenbaum196642_13-1">b</a> <a href="#cite_ref-FOOTNOTEWeizenbaum196642_13-2">c</a> <a href="#CITEREFWeizenbaum1966">Weizenbaum 1966</a>, p. 42. </li> <li id="cite_note-FOOTNOTEThomas1995112-14"><a href="#cite_ref-FOOTNOTEThomas1995112_14-0">^</a> <a href="#CITEREFThomas1995">Thomas 1995</a>, p. 112. </li> <li id="cite_note-FOOTNOTEBoden2006370-15"><a href="#cite_ref-FOOTNOTEBoden2006370_15-0">^</a> <a href="#CITEREFBoden2006">Boden 2006</a>, p. 370. </li> <li id="cite_note-FOOTNOTEColbyHilfWeberKraemer1972220-16">^ <a href="#cite_ref-FOOTNOTEColbyHilfWeberKraemer1972220_16-0">a</a> <a href="#cite_ref-FOOTNOTEColbyHilfWeberKraemer1972220_16-1">b</a> <a href="#CITEREFColbyHilfWeberKraemer1972">Colby et al. 1972</a>, p. 220. </li> <li id="cite_note-17"><a href="#cite_ref-17">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.zdnet.com/article/computer-chatbot-eugene-goostman-passes-the-turing-test/">"Computer chatbot ;Eugene Goostman; passes the Turing test | ZDNET"</a>. <a href="/wiki/ZDNet" class="mw-redirect" title="ZDNet">ZDNet</a>. Retrieved 26 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=ZDNet&rft.atitle=Computer+chatbot+%3BEugene+Goostman%3B+passes+the+Turing+test+%7C+ZDNET&rft_id=https%3A%2F%2Fwww.zdnet.com%2Farticle%2Fcomputer-chatbot-eugene-goostman-passes-the-turing-test%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-18"><a href="#cite_ref-18">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMasnick2014" class="citation web cs1">Masnick, Mike (9 June 2014). <a rel="nofollow" class="external text" href="https://www.techdirt.com/2014/06/09/no-supercomputer-did-not-pass-turing-test-first-time-everyone-should-know-better/">"No, A 'Supercomputer' Did NOT Pass The Turing Test for the First Time And Everyone Should Know Better"</a>. Retrieved 26 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=No%2C+A+%27Supercomputer%27+Did+NOT+Pass+The+Turing+Test+for+the+First+Time+And+Everyone+Should+Know+Better&rft.date=2014-06-09&rft.aulast=Masnick&rft.aufirst=Mike&rft_id=https%3A%2F%2Fwww.techdirt.com%2F2014%2F06%2F09%2Fno-supercomputer-did-not-pass-turing-test-first-time-everyone-should-know-better%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-economist_lambda-19"><a href="#cite_ref-economist_lambda_19-0">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDan_Williams2022" class="citation news cs1">Dan Williams (9 June 2022). <a rel="nofollow" class="external text" href="https://www.economist.com/by-invitation/2022/06/09/artificial-neural-networks-are-making-strides-towards-consciousness-according-to-blaise-aguera-y-arcas">"Artificial neural networks are making strides towards consciousness, according to Blaise Agüera y Arcas"</a>. The Economist. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20220609093229/https://www.economist.com/by-invitation/2022/06/09/artificial-neural-networks-are-making-strides-towards-consciousness-according-to-blaise-aguera-y-arcas">Archived</a> from the original on 9 June 2022. Retrieved 13 June 2022.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+Economist&rft.atitle=Artificial+neural+networks+are+making+strides+towards+consciousness%2C+according+to+Blaise+Ag%C3%BCera+y+Arcas&rft.date=2022-06-09&rft.au=Dan+Williams&rft_id=https%3A%2F%2Fwww.economist.com%2Fby-invitation%2F2022%2F06%2F09%2Fartificial-neural-networks-are-making-strides-towards-consciousness-according-to-blaise-aguera-y-arcas&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-washington_post_lambda-20"><a href="#cite_ref-washington_post_lambda_20-0">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNitasha_Tiku2022" class="citation news cs1">Nitasha Tiku (11 June 2022). <a rel="nofollow" class="external text" href="https://www.washingtonpost.com/technology/2022/06/11/google-ai-lamda-blake-lemoine/">"The Google engineer who thinks the company's AI has come to life"</a>. Washington Post. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20220611124805/https://www.washingtonpost.com/technology/2022/06/11/google-ai-lamda-blake-lemoine/">Archived</a> from the original on 11 June 2022. Retrieved 13 June 2022.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Washington+Post&rft.atitle=The+Google+engineer+who+thinks+the+company%27s+AI+has+come+to+life&rft.date=2022-06-11&rft.au=Nitasha+Tiku&rft_id=https%3A%2F%2Fwww.washingtonpost.com%2Ftechnology%2F2022%2F06%2F11%2Fgoogle-ai-lamda-blake-lemoine%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-fortune_lambda-21"><a href="#cite_ref-fortune_lambda_21-0">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJeremy_Kahn2022" class="citation news cs1">Jeremy Kahn (13 June 2022). <a rel="nofollow" class="external text" href="https://fortune.com/2022/06/13/google-ai-researchers-sentient-chatbot-claims-ridiculed-by-experts/">"A.I. experts say the Google researcher's claim that his chatbot became 'sentient' is ridiculous—but also highlights big problems in the field"</a>. Fortune. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20220613132958/https://fortune.com/2022/06/13/google-ai-researchers-sentient-chatbot-claims-ridiculed-by-experts/">Archived</a> from the original on 13 June 2022. Retrieved 13 June 2022.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Fortune&rft.atitle=A.I.+experts+say+the+Google+researcher%27s+claim+that+his+chatbot+became+%27sentient%27+is+ridiculous%E2%80%94but+also+highlights+big+problems+in+the+field&rft.date=2022-06-13&rft.au=Jeremy+Kahn&rft_id=https%3A%2F%2Ffortune.com%2F2022%2F06%2F13%2Fgoogle-ai-researchers-sentient-chatbot-claims-ridiculed-by-experts%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-22"><a href="#cite_ref-22">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBiever2023" class="citation journal cs1">Biever, Celeste (25 July 2023). <a rel="nofollow" class="external text" href="https://www.nature.com/articles/d41586-023-02361-7">"ChatGPT broke the Turing test — the race is on for new ways to assess AI"</a>. Nature. 619 (7971): 686–689. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2023Natur.619..686B">2023Natur.619..686B</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fd41586-023-02361-7">10.1038/d41586-023-02361-7</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/37491395">37491395</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20230726211022/https://www.nature.com/articles/d41586-023-02361-7">Archived</a> from the original on 26 July 2023. Retrieved 26 March 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Nature&rft.atitle=ChatGPT+broke+the+Turing+test+%E2%80%94+the+race+is+on+for+new+ways+to+assess+AI&rft.volume=619&rft.issue=7971&rft.pages=686-689&rft.date=2023-07-25&rft_id=info%3Apmid%2F37491395&rft_id=info%3Adoi%2F10.1038%2Fd41586-023-02361-7&rft_id=info%3Abibcode%2F2023Natur.619..686B&rft.aulast=Biever&rft.aufirst=Celeste&rft_id=https%3A%2F%2Fwww.nature.com%2Farticles%2Fd41586-023-02361-7&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-23"><a href="#cite_ref-23">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFScott" class="citation web cs1">Scott, Cameron. <a rel="nofollow" class="external text" href="https://humsci.stanford.edu/feature/study-finds-chatgpts-latest-bot-behaves-humans-only-better">"Study finds ChatGPT's latest bot behaves like humans, only better | Stanford School of Humanities and Sciences"</a>. humsci.stanford.edu. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240326182336/https://humsci.stanford.edu/feature/study-finds-chatgpts-latest-bot-behaves-humans-only-better">Archived</a> from the original on 26 March 2024. Retrieved 26 March 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=humsci.stanford.edu&rft.atitle=Study+finds+ChatGPT%27s+latest+bot+behaves+like+humans%2C+only+better+%7C+Stanford+School+of+Humanities+and+Sciences&rft.aulast=Scott&rft.aufirst=Cameron&rft_id=https%3A%2F%2Fhumsci.stanford.edu%2Ffeature%2Fstudy-finds-chatgpts-latest-bot-behaves-humans-only-better&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-24"><a href="#cite_ref-24">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMeiXieYuanJackson2024" class="citation journal cs1">Mei, Qiaozhu; Xie, Yutong; Yuan, Walter; Jackson, Matthew O. (27 February 2024). <a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10907317">"A Turing test of whether AI chatbots are behaviorally similar to humans"</a>. Proceedings of the National Academy of Sciences. 121 (9): e2313925121. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2024PNAS..12113925M">2024PNAS..12113925M</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1073%2Fpnas.2313925121">10.1073/pnas.2313925121</a>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0027-8424">0027-8424</a>. <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10907317">10907317</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/38386710">38386710</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+National+Academy+of+Sciences&rft.atitle=A+Turing+test+of+whether+AI+chatbots+are+behaviorally+similar+to+humans&rft.volume=121&rft.issue=9&rft.pages=e2313925121&rft.date=2024-02-27&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC10907317%23id-name%3DPMC&rft_id=info%3Abibcode%2F2024PNAS..12113925M&rft_id=info%3Apmid%2F38386710&rft_id=info%3Adoi%2F10.1073%2Fpnas.2313925121&rft.issn=0027-8424&rft.aulast=Mei&rft.aufirst=Qiaozhu&rft.au=Xie%2C+Yutong&rft.au=Yuan%2C+Walter&rft.au=Jackson%2C+Matthew+O.&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC10907317&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-25"><a href="#cite_ref-25">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHoy2018" class="citation journal cs1">Hoy, Matthew B. (2 January 2018). <a rel="nofollow" class="external text" href="https://www.tandfonline.com/doi/full/10.1080/02763869.2018.1404391">"Alexa, Siri, Cortana, and More: An Introduction to Voice Assistants"</a>. Medical Reference Services Quarterly. 37 (1): 81–88. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F02763869.2018.1404391">10.1080/02763869.2018.1404391</a>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0276-3869">0276-3869</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/29327988">29327988</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Medical+Reference+Services+Quarterly&rft.atitle=Alexa%2C+Siri%2C+Cortana%2C+and+More%3A+An+Introduction+to+Voice+Assistants&rft.volume=37&rft.issue=1&rft.pages=81-88&rft.date=2018-01-02&rft.issn=0276-3869&rft_id=info%3Apmid%2F29327988&rft_id=info%3Adoi%2F10.1080%2F02763869.2018.1404391&rft.aulast=Hoy&rft.aufirst=Matthew+B.&rft_id=https%3A%2F%2Fwww.tandfonline.com%2Fdoi%2Ffull%2F10.1080%2F02763869.2018.1404391&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-26"><a href="#cite_ref-26">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.androidauthority.com/siri-vs-alexa-vs-google-assistant-vs-bixby-3192996/">"Siri vs Alexa vs Google Assistant vs Bixby: Which one reigns supreme?"</a>. 29 January 2024. Retrieved 26 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Siri+vs+Alexa+vs+Google+Assistant+vs+Bixby%3A+Which+one+reigns+supreme%3F&rft.date=2024-01-29&rft_id=https%3A%2F%2Fwww.androidauthority.com%2Fsiri-vs-alexa-vs-google-assistant-vs-bixby-3192996%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-27"><a href="#cite_ref-27">^</a> Oxford English Dictionary, "virtual assistant", 3rd ed., Oxford University Press, 2010. Accessed September 26, 2024. <a rel="nofollow" class="external free" href="https://www.oxfordlearnersdictionaries.com/definition/english/chatbot?q=chatbot">https://www.oxfordlearnersdictionaries.com/definition/english/chatbot?q=chatbot</a>. </li> <li id="cite_note-28"><a href="#cite_ref-28">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.microsoft.com/en-us/cortana">"Cortana - Your personal productivity assistant"</a>. Microsoft. Retrieved 26 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Microsoft&rft.atitle=Cortana+-+Your+personal+productivity+assistant&rft_id=https%3A%2F%2Fwww.microsoft.com%2Fen-us%2Fcortana&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-29"><a href="#cite_ref-29">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWithers2007" class="citation cs2">Withers, Steven (11 December 2007), <a rel="nofollow" class="external text" href="http://www.itwire.com/your-it-news/home-it/15748-flirty-bot-passes-for-human">"Flirty Bot Passes for Human"</a>, iTWire, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20171004140133/https://www.itwire.com/your-it-news/home-it/15748-flirty-bot-passes-for-human">archived</a> from the original on 4 October 2017, retrieved 10 February 2010</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=iTWire&rft.atitle=Flirty+Bot+Passes+for+Human&rft.date=2007-12-11&rft.aulast=Withers&rft.aufirst=Steven&rft_id=http%3A%2F%2Fwww.itwire.com%2Fyour-it-news%2Fhome-it%2F15748-flirty-bot-passes-for-human&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-30"><a href="#cite_ref-30">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWilliams2007" class="citation cs2">Williams, Ian (10 December 2007), <a rel="nofollow" class="external text" href="http://www.v3.co.uk/vnunet/news/2205441/online-love-seekers-warned-flirt-bots">"Online Love Seerkers Warned Flirt Bots"</a>, V3, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100424101329/http://www.v3.co.uk/vnunet/news/2205441/online-love-seekers-warned-flirt-bots">archived</a> from the original on 24 April 2010, retrieved 10 February 2010</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=V3&rft.atitle=Online+Love+Seerkers+Warned+Flirt+Bots&rft.date=2007-12-10&rft.aulast=Williams&rft.aufirst=Ian&rft_id=http%3A%2F%2Fwww.v3.co.uk%2Fvnunet%2Fnews%2F2205441%2Fonline-love-seekers-warned-flirt-bots&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTEDescartes1996[httpsarchiveorgdetailsdiscourseonmetho0000desc_i4z8page34_34]–35-31"><a href="#cite_ref-FOOTNOTEDescartes1996[httpsarchiveorgdetailsdiscourseonmetho0000desc_i4z8page34_34]–35_31-0">^</a> <a href="#CITEREFDescartes1996">Descartes 1996</a>, pp. <a rel="nofollow" class="external text" href="https://archive.org/details/discourseonmetho0000desc_i4z8/page/34">34</a>–35. </li> <li id="cite_note-32"><a href="#cite_ref-32">^</a> For an example of property dualism, see <a href="/wiki/Qualia" title="Qualia">Qualia</a>. </li> <li id="cite_note-33"><a href="#cite_ref-33">^</a> Noting that materialism does not necessitate the possibility of artificial minds (for example, <a href="/wiki/Roger_Penrose#Consciousness" title="Roger Penrose">Roger Penrose</a>), any more than dualism necessarily precludes the possibility. (See, for example, <a href="/wiki/Property_dualism" title="Property dualism">Property dualism</a>.) </li> <li id="cite_note-34"><a href="#cite_ref-34">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAyer2001" class="citation cs2"><a href="/wiki/A._J._Ayer" title="A. J. Ayer">Ayer, A. J.</a> (2001), "Language, Truth and Logic", Nature, 138 (3498), <a href="/wiki/Penguin_Books" title="Penguin Books">Penguin</a>: 140, <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/1936Natur.138..823G">1936Natur.138..823G</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2F138823a0">10.1038/138823a0</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-334-04122-1" title="Special:BookSources/978-0-334-04122-1"><bdi>978-0-334-04122-1</bdi></a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:4121089">4121089</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Nature&rft.atitle=Language%2C+Truth+and+Logic&rft.volume=138&rft.issue=3498&rft.pages=140&rft.date=2001&rft_id=info%3Adoi%2F10.1038%2F138823a0&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A4121089%23id-name%3DS2CID&rft_id=info%3Abibcode%2F1936Natur.138..823G&rft.isbn=978-0-334-04122-1&rft.aulast=Ayer&rft.aufirst=A.+J.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">[<a href="/wiki/Wikipedia:Please_clarify" title="Wikipedia:Please clarify">clarification needed</a>] </li> <li id="cite_note-35"><a href="#cite_ref-35">^</a> Rapaport, W.J. (2003). <a rel="nofollow" class="external text" href="https://cse.buffalo.edu/~rapaport/Papers/TURING">How to Pass a Turing Test</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240613183326/https://cse.buffalo.edu/~rapaport/Papers/TURING">Archived</a> 13 June 2024 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>. In: Moor, J.H. (eds) The Turing Test. Studies in Cognitive Systems, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0105-2_9 </li> <li id="cite_note-36"><a href="#cite_ref-36">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAmini2020" class="citation web cs1">Amini, Majid (1 May 2020). <a rel="nofollow" class="external text" href="https://openurl.ebsco.com/contentitem/gcd:144758985?sid=ebsco:plink:crawler&id=ebsco:gcd:144758985">"Cognition as Computation: From Swift to Turing. | Humanities Bulletin | EBSCOhost"</a>. openurl.ebsco.com. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240613183323/https://openurl.ebsco.com/contentitem/gcd:144758985?sid=ebsco:plink:crawler&id=ebsco:gcd:144758985">Archived</a> from the original on 13 June 2024. Retrieved 13 June 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=openurl.ebsco.com&rft.atitle=Cognition+as+Computation%3A+From+Swift+to+Turing.+%7C+Humanities+Bulletin+%7C+EBSCOhost&rft.date=2020-05-01&rft.aulast=Amini&rft.aufirst=Majid&rft_id=https%3A%2F%2Fopenurl.ebsco.com%2Fcontentitem%2Fgcd%3A144758985%3Fsid%3Debsco%3Aplink%3Acrawler%26id%3Debsco%3Agcd%3A144758985&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-37"><a href="#cite_ref-37">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSwift1726" class="citation web cs1">Swift, Jonathan (1726). <a class="external text" href="https://en.wikisource.org/wiki/The_Works_of_the_Rev._Jonathan_Swift/Volume_6/A_Voyage_to_Brobdingnag/Chapter_3">"A Voyage to Brobdingnag. Chapter 3"</a>. en.wikisource.org. Retrieved 13 June 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=en.wikisource.org&rft.atitle=A+Voyage+to+Brobdingnag.+Chapter+3&rft.date=1726&rft.aulast=Swift&rft.aufirst=Jonathan&rft_id=https%3A%2F%2Fen.wikisource.org%2Fwiki%2FThe_Works_of_the_Rev._Jonathan_Swift%2FVolume_6%2FA_Voyage_to_Brobdingnag%2FChapter_3&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-:3-38">^ <a href="#cite_ref-:3_38-0">a</a> <a href="#cite_ref-:3_38-1">b</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSvilpis2008" class="citation journal cs1">Svilpis, Janis (2008). "The Science-Fiction Prehistory of the Turing Test". Science Fiction Studies. 35 (3): 430–449. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0091-7729">0091-7729</a>. <a href="/wiki/JSTOR_(identifier)" class="mw-redirect" title="JSTOR (identifier)">JSTOR</a> <a rel="nofollow" class="external text" href="https://www.jstor.org/stable/25475177">25475177</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Science+Fiction+Studies&rft.atitle=The+Science-Fiction+Prehistory+of+the+Turing+Test&rft.volume=35&rft.issue=3&rft.pages=430-449&rft.date=2008&rft_id=https%3A%2F%2Fwww.jstor.org%2Fstable%2F25475177%23id-name%3DJSTOR&rft.issn=0091-7729&rft.aulast=Svilpis&rft.aufirst=Janis&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-39"><a href="#cite_ref-39">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWansbrough2021" class="citation book cs1">Wansbrough, Aleks (2021). Capitalism and the enchanted screen: myths and allegories in the digital age. New York: Bloomsbury Academic. p. 114. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-5013-5639-1" title="Special:BookSources/978-1-5013-5639-1"><bdi>978-1-5013-5639-1</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/1202731640">1202731640</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Capitalism+and+the+enchanted+screen%3A+myths+and+allegories+in+the+digital+age&rft.place=New+York&rft.pages=114&rft.pub=Bloomsbury+Academic&rft.date=2021&rft_id=info%3Aoclcnum%2F1202731640&rft.isbn=978-1-5013-5639-1&rft.aulast=Wansbrough&rft.aufirst=Aleks&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-40"><a href="#cite_ref-40">^</a> The <a href="/wiki/Dartmouth_conference" class="mw-redirect" title="Dartmouth conference">Dartmouth conferences</a> of 1956 are widely considered the "birth of AI". (<a href="#CITEREFCrevier1993">Crevier 1993</a>, p. 49) </li> <li id="cite_note-FOOTNOTEMcCorduck200495-41"><a href="#cite_ref-FOOTNOTEMcCorduck200495_41-0">^</a> <a href="#CITEREFMcCorduck2004">McCorduck 2004</a>, p. 95. </li> <li id="cite_note-FOOTNOTECopeland20031-42"><a href="#cite_ref-FOOTNOTECopeland20031_42-0">^</a> <a href="#CITEREFCopeland2003">Copeland 2003</a>, p. 1. </li> <li id="cite_note-FOOTNOTECopeland20032-43"><a href="#cite_ref-FOOTNOTECopeland20032_43-0">^</a> <a href="#CITEREFCopeland2003">Copeland 2003</a>, p. 2. </li> <li id="cite_note-44"><a href="#cite_ref-44">^</a> <a href="#CITEREFTuring1948">"Intelligent Machinery" (1948)</a> was not published by Turing, and did not see publication until 1968 in: <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEvansRobertson1968" class="citation cs2">Evans, A. D. J.; Robertson (1968), Cybernetics: Key Papers, University Park Press</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Cybernetics%3A+Key+Papers&rft.pub=University+Park+Press&rft.date=1968&rft.aulast=Evans&rft.aufirst=A.+D.+J.&rft.au=Robertson&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li></ul> </li> <li id="cite_note-FOOTNOTETuring1948412-45"><a href="#cite_ref-FOOTNOTETuring1948412_45-0">^</a> <a href="#CITEREFTuring1948">Turing 1948</a>, p. 412. </li> <li id="cite_note-46"><a href="#cite_ref-46">^</a> In 1948, working with his former undergraduate colleague, <a href="/wiki/DG_Champernowne" class="mw-redirect" title="DG Champernowne">DG Champernowne</a>, Turing began writing a chess program for a computer that did not yet exist and, in 1952, lacking a computer powerful enough to execute the program, played a game in which he simulated it, taking about half an hour over each move. The game was recorded, and the program lost to Turing's colleague <a href="/wiki/Alick_Glennie" title="Alick Glennie">Alick Glennie</a>, although it is said that it won a game against Champernowne's wife. </li> <li id="cite_note-FOOTNOTETuring1948[[Category:Wikipedia_articles_needing_page_number_citations_from_May_2011]]<sup_class="noprint_Inline-Template_"_style="white-space:nowrap;">&#91;[[Wikipedia:Citing_sources|<span_title="This_citation_requires_a_reference_to_the_specific_page_or_range_of_pages_in_which_the_material_appears.&#32;(May_2011)">page&nbsp;needed]]&#93;-47"><a href="#cite_ref-FOOTNOTETuring1948[[Category:Wikipedia_articles_needing_page_number_citations_from_May_2011]]<sup_class="noprint_Inline-Template_"_style="white-space:nowrap;">&#91;[[Wikipedia:Citing_sources|<span_title="This_citation_requires_a_reference_to_the_specific_page_or_range_of_pages_in_which_the_material_appears.&#32;(May_2011)">page&nbsp;needed]]&#93;_47-0">^</a> <a href="#CITEREFTuring1948">Turing 1948</a>, p. [<a href="/wiki/Wikipedia:Citing_sources" title="Wikipedia:Citing sources">page needed</a>]. </li> <li id="cite_note-FOOTNOTEHarnad20041-48"><a href="#cite_ref-FOOTNOTEHarnad20041_48-0">^</a> <a href="#CITEREFHarnad2004">Harnad 2004</a>, p. 1. </li> <li id="cite_note-FOOTNOTETuring1950434-49">^ <a href="#cite_ref-FOOTNOTETuring1950434_49-0">a</a> <a href="#cite_ref-FOOTNOTETuring1950434_49-1">b</a> <a href="#cite_ref-FOOTNOTETuring1950434_49-2">c</a> <a href="#cite_ref-FOOTNOTETuring1950434_49-3">d</a> <a href="#cite_ref-FOOTNOTETuring1950434_49-4">e</a> <a href="#CITEREFTuring1950">Turing 1950</a>, p. 434. </li> <li id="cite_note-FOOTNOTEShahWarwick2010a-50">^ <a href="#cite_ref-FOOTNOTEShahWarwick2010a_50-0">a</a> <a href="#cite_ref-FOOTNOTEShahWarwick2010a_50-1">b</a> <a href="#CITEREFShahWarwick2010a">Shah & Warwick 2010a</a>. </li> <li id="cite_note-FOOTNOTETuring1950446-51"><a href="#cite_ref-FOOTNOTETuring1950446_51-0">^</a> <a href="#CITEREFTuring1950">Turing 1950</a>, p. 446. </li> <li id="cite_note-52"><a href="#cite_ref-52">^</a> <a href="#CITEREFTuring1952">Turing 1952</a>, pp. 524–525. Turing does not seem to distinguish between "man" as a gender and "man" as a human. In the former case, this formulation would be closer to the imitation game, whereas in the latter it would be closer to current depictions of the test. </li> <li id="cite_note-FOOTNOTESearle1980-53">^ <a href="#cite_ref-FOOTNOTESearle1980_53-0">a</a> <a href="#cite_ref-FOOTNOTESearle1980_53-1">b</a> <a href="#CITEREFSearle1980">Searle 1980</a>. </li> <li id="cite_note-54"><a href="#cite_ref-54">^</a> There are a large number of arguments against Searle's <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a>. A few are: <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHauser1997" class="citation cs2"><a href="/w/index.php?title=Larry_Hauser&action=edit&redlink=1" class="new" title="Larry Hauser (page does not exist)">Hauser, Larry</a> (1997), "Searle's Chinese Box: Debunking the Chinese Room Argument", Minds and Machines, 7 (2): 199–226, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1008255830248">10.1023/A:1008255830248</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:32153206">32153206</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Searle%27s+Chinese+Box%3A+Debunking+the+Chinese+Room+Argument&rft.volume=7&rft.issue=2&rft.pages=199-226&rft.date=1997&rft_id=info%3Adoi%2F10.1023%2FA%3A1008255830248&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A32153206%23id-name%3DS2CID&rft.aulast=Hauser&rft.aufirst=Larry&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">.</li></ul> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRehman2009" class="citation cs2">Rehman, Warren. (19 July 2009), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100719002718/http://knol.google.com/k/warren-rehman/argument-against-the-chinese-room/19dflpeo1gadq/2">Argument against the Chinese Room Argument</a>, archived from <a rel="nofollow" class="external text" href="http://knol.google.com/k/warren-rehman/argument-against-the-chinese-room/19dflpeo1gadq/2">the original</a> on 19 July 2010</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Argument+against+the+Chinese+Room+Argument&rft.date=2009-07-19&rft.aulast=Rehman&rft.aufirst=Warren.&rft_id=http%3A%2F%2Fknol.google.com%2Fk%2Fwarren-rehman%2Fargument-against-the-chinese-room%2F19dflpeo1gadq%2F2&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">.</li></ul> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFThornley1997" class="citation cs2">Thornley, David H. (1997), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090426055512/http://www.visi.com/~thornley/david/philosophy/searle.html">Why the Chinese Room Doesn't Work</a>, archived from <a rel="nofollow" class="external text" href="http://www.visi.com/~thornley/david/philosophy/searle.html">the original</a> on 26 April 2009</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Why+the+Chinese+Room+Doesn%27t+Work&rft.date=1997&rft.aulast=Thornley&rft.aufirst=David+H.&rft_id=http%3A%2F%2Fwww.visi.com%2F~thornley%2Fdavid%2Fphilosophy%2Fsearle.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li></ul> </li> <li id="cite_note-55"><a href="#cite_ref-55">^</a> M. Bishop & J. Preston (eds.) (2001) Essays on Searle's Chinese Room Argument. Oxford University Press. </li> <li id="cite_note-FOOTNOTESaygin2000479-56"><a href="#cite_ref-FOOTNOTESaygin2000479_56-0">^</a> <a href="#CITEREFSaygin2000">Saygin 2000</a>, p. 479. </li> <li id="cite_note-FOOTNOTESundman2003-57"><a href="#cite_ref-FOOTNOTESundman2003_57-0">^</a> <a href="#CITEREFSundman2003">Sundman 2003</a>. </li> <li id="cite_note-FOOTNOTELoebner1994-58"><a href="#cite_ref-FOOTNOTELoebner1994_58-0">^</a> <a href="#CITEREFLoebner1994">Loebner 1994</a>. </li> <li id="cite_note-Artificial_Stupidity-59">^ <a href="#cite_ref-Artificial_Stupidity_59-0">a</a> <a href="#cite_ref-Artificial_Stupidity_59-1">b</a> <a href="#cite_ref-Artificial_Stupidity_59-2">c</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation magazine cs1">"Artificial Stupidity". <a href="/wiki/The_Economist" title="The Economist">The Economist</a>. Vol. 324, no. 7770. 1 August 1992. p. 14.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+Economist&rft.atitle=Artificial+Stupidity&rft.volume=324&rft.issue=7770&rft.pages=14&rft.date=1992-08-01&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-SHAPIRO_SHIEBER-60">^ <a href="#cite_ref-SHAPIRO_SHIEBER_60-0">a</a> <a href="#cite_ref-SHAPIRO_SHIEBER_60-1">b</a> <a href="#cite_ref-SHAPIRO_SHIEBER_60-2">c</a> <a href="#CITEREFShapiro1992">Shapiro 1992</a>, p. 10–11 and <a href="#CITEREFShieber1994">Shieber 1994</a>, amongst others. </li> <li id="cite_note-FOOTNOTEShieber199477-61">^ <a href="#cite_ref-FOOTNOTEShieber199477_61-0">a</a> <a href="#cite_ref-FOOTNOTEShieber199477_61-1">b</a> <a href="#CITEREFShieber1994">Shieber 1994</a>, p. 77. </li> <li id="cite_note-saf-62"><a href="#cite_ref-saf_62-0">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation episode cs1"><a rel="nofollow" class="external text" href="http://www.chedd-angier.com/frontiers/season4.html">"Turing test, on season 4, episode 3"</a>. <a href="/wiki/Scientific_American_Frontiers" title="Scientific American Frontiers">Scientific American Frontiers</a>. Chedd-Angier Production Company. 1993–1994. <a href="/wiki/PBS" title="PBS">PBS</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20060101000000/http://www.pbs.org/saf/transcripts/transcript403.htm">Archived</a> from the original on 1 January 2006.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Scientific+American+Frontiers&rft.pub=Chedd-Angier+Production+Company&rft.date=1993%2F1994&rft_id=http%3A%2F%2Fwww.chedd-angier.com%2Ffrontiers%2Fseason4.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-63"><a href="#cite_ref-63">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.cloudflare.com/en-in/learning/bots/how-captchas-work/">"How CAPTCHAs work | What does CAPTCHA mean? | Cloudflare"</a>. Retrieved 27 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=How+CAPTCHAs+work+%7C+What+does+CAPTCHA+mean%3F+%7C+Cloudflare&rft_id=https%3A%2F%2Fwww.cloudflare.com%2Fen-in%2Flearning%2Fbots%2Fhow-captchas-work%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-64"><a href="#cite_ref-64">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.google.com/recaptcha/about/">"reCAPTCHA"</a>. Google. Retrieved 27 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Google&rft.atitle=reCAPTCHA&rft_id=https%3A%2F%2Fwww.google.com%2Frecaptcha%2Fabout%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-65"><a href="#cite_ref-65">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://datadome.co/guides/captcha/how-does-recaptcha-work/">"How does reCAPTCHA work? How it is triggered & bypassed"</a>. Retrieved 27 September 2024.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=How+does+reCAPTCHA+work%3F+How+it+is+triggered+%26+bypassed&rft_id=https%3A%2F%2Fdatadome.co%2Fguides%2Fcaptcha%2Fhow-does-recaptcha-work%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTETraiger2000-66">^ <a href="#cite_ref-FOOTNOTETraiger2000_66-0">a</a> <a href="#cite_ref-FOOTNOTETraiger2000_66-1">b</a> <a href="#cite_ref-FOOTNOTETraiger2000_66-2">c</a> <a href="#CITEREFTraiger2000">Traiger 2000</a>. </li> <li id="cite_note-FOOTNOTESayginRobertsBeber2008-67"><a href="#cite_ref-FOOTNOTESayginRobertsBeber2008_67-0">^</a> <a href="#CITEREFSayginRobertsBeber2008">Saygin, Roberts & Beber 2008</a>. </li> <li id="cite_note-FOOTNOTEMoor2003-68">^ <a href="#cite_ref-FOOTNOTEMoor2003_68-0">a</a> <a href="#cite_ref-FOOTNOTEMoor2003_68-1">b</a> <a href="#CITEREFMoor2003">Moor 2003</a>. </li> <li id="cite_note-FOOTNOTETraiger200099-69"><a href="#cite_ref-FOOTNOTETraiger200099_69-0">^</a> <a href="#CITEREFTraiger2000">Traiger 2000</a>, p. 99. </li> <li id="cite_note-FOOTNOTESterrett2000-70"><a href="#cite_ref-FOOTNOTESterrett2000_70-0">^</a> <a href="#CITEREFSterrett2000">Sterrett 2000</a>. </li> <li id="cite_note-FOOTNOTEShah2011-71"><a href="#cite_ref-FOOTNOTEShah2011_71-0">^</a> <a href="#CITEREFShah2011">Shah 2011</a>. </li> <li id="cite_note-72"><a href="#cite_ref-72">^</a> <a href="#CITEREFGenova1994">Genova 1994</a>, <a href="#CITEREFHayesFord1995">Hayes & Ford 1995</a>, <a href="#CITEREFHeil1998">Heil 1998</a>, <a href="#CITEREFDreyfus1979">Dreyfus 1979</a> </li> <li id="cite_note-FOOTNOTETuring1948431-73"><a href="#cite_ref-FOOTNOTETuring1948431_73-0">^</a> <a href="#CITEREFTuring1948">Turing 1948</a>, p. 431. </li> <li id="cite_note-FOOTNOTEProudfoot2013398-74"><a href="#cite_ref-FOOTNOTEProudfoot2013398_74-0">^</a> <a href="#CITEREFProudfoot2013">Proudfoot 2013</a>, p. 398. </li> <li id="cite_note-FOOTNOTEGonçalves2023a-75"><a href="#cite_ref-FOOTNOTEGonçalves2023a_75-0">^</a> <a href="#CITEREFGonçalves2023a">Gonçalves 2023a</a>. </li> <li id="cite_note-FOOTNOTEGonçalves2023b-76"><a href="#cite_ref-FOOTNOTEGonçalves2023b_76-0">^</a> <a href="#CITEREFGonçalves2023b">Gonçalves 2023b</a>. </li> <li id="cite_note-FOOTNOTEDanziger2022-77"><a href="#cite_ref-FOOTNOTEDanziger2022_77-0">^</a> <a href="#CITEREFDanziger2022">Danziger 2022</a>. </li> <li id="cite_note-FOOTNOTETuring1950442-78">^ <a href="#cite_ref-FOOTNOTETuring1950442_78-0">a</a> <a href="#cite_ref-FOOTNOTETuring1950442_78-1">b</a> <a href="#cite_ref-FOOTNOTETuring1950442_78-2">c</a> <a href="#CITEREFTuring1950">Turing 1950</a>, p. 442. </li> <li id="cite_note-79"><a href="#cite_ref-79">^</a> R. Epstein, G. Roberts, G. Poland, (eds.) Parsing the Turing Test: Philosophical and Methodological Issues in the Quest for the Thinking Computer. Springer: Dordrecht, Netherlands </li> <li id="cite_note-80"><a href="#cite_ref-80">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFThompson2005" class="citation news cs1">Thompson, Clive (July 2005). <a rel="nofollow" class="external text" href="https://www.wired.com/wired/archive/13.07/posts.html?pg=5">"The Other Turing Test"</a>. Issue 13.07. <a href="/wiki/WIRED" class="mw-redirect" title="WIRED">WIRED</a> magazine. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110819081652/http://www.wired.com/wired/archive/13.07/posts.html?pg=5">Archived</a> from the original on 19 August 2011. Retrieved 10 September 2011. <q>As a gay man who spent nearly his whole life in the closet, Turing must have been keenly aware of the social difficulty of constantly faking your real identity. And there's a delicious irony in the fact that decades of AI scientists have chosen to ignore Turing's gender-twisting test – only to have it seized upon by three college-age women</q></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Issue+13.07&rft.atitle=The+Other+Turing+Test&rft.date=2005-07&rft.aulast=Thompson&rft.aufirst=Clive&rft_id=https%3A%2F%2Fwww.wired.com%2Fwired%2Farchive%2F13.07%2Fposts.html%3Fpg%3D5&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">. (<a rel="nofollow" class="external text" href="http://www.collisiondetection.net/mt/archives/2005/07/research_subjec.php">Full version</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061743/http://www.collisiondetection.net/mt/archives/2005/07/research_subjec.php">Archived</a> 23 March 2019 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>). </li> <li id="cite_note-FOOTNOTEColbyHilfWeberKraemer1972-81"><a href="#cite_ref-FOOTNOTEColbyHilfWeberKraemer1972_81-0">^</a> <a href="#CITEREFColbyHilfWeberKraemer1972">Colby et al. 1972</a>. </li> <li id="cite_note-FOOTNOTESwirski2000-82">^ <a href="#cite_ref-FOOTNOTESwirski2000_82-0">a</a> <a href="#cite_ref-FOOTNOTESwirski2000_82-1">b</a> <a href="#CITEREFSwirski2000">Swirski 2000</a>. </li> <li id="cite_note-FOOTNOTESayginCicekli2002-83"><a href="#cite_ref-FOOTNOTESayginCicekli2002_83-0">^</a> <a href="#CITEREFSayginCicekli2002">Saygin & Cicekli 2002</a>. </li> <li id="cite_note-FOOTNOTETuring1950under_"Critique_of_the_New_Problem"-84"><a href="#cite_ref-FOOTNOTETuring1950under_"Critique_of_the_New_Problem"_84-0">^</a> <a href="#CITEREFTuring1950">Turing 1950</a>, under "Critique of the New Problem". </li> <li id="cite_note-FOOTNOTEHaugeland19858-85"><a href="#cite_ref-FOOTNOTEHaugeland19858_85-0">^</a> <a href="#CITEREFHaugeland1985">Haugeland 1985</a>, p. 8. </li> <li id="cite_note-86"><a href="#cite_ref-86">^</a> "These six disciplines," write <a href="/wiki/Stuart_J._Russell" title="Stuart J. Russell">Stuart J. Russell</a> and <a href="/wiki/Peter_Norvig" title="Peter Norvig">Peter Norvig</a>, "represent most of AI." <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, p. 3 </li> <li id="cite_note-87"><a href="#cite_ref-87">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFUrban,_Tim2015" class="citation web cs1">Urban, Tim (February 2015). <a rel="nofollow" class="external text" href="http://waitbutwhy.com/2015/01/artificial-intelligence-revolution-2.html">"The AI Revolution: Our Immortality or Extinction"</a>. Wait But Why. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061749/https://waitbutwhy.com/2015/01/artificial-intelligence-revolution-2.html">Archived</a> from the original on 23 March 2019. Retrieved 5 April 2015.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+AI+Revolution%3A+Our+Immortality+or+Extinction&rft.pub=Wait+But+Why&rft.date=2015-02&rft.au=Urban%2C+Tim&rft_id=http%3A%2F%2Fwaitbutwhy.com%2F2015%2F01%2Fartificial-intelligence-revolution-2.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-88"><a href="#cite_ref-88">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSmith,_G._W.2015" class="citation web cs1">Smith, G. W. (27 March 2015). <a rel="nofollow" class="external text" href="http://artent.net/2015/03/27/art-and-artificial-intelligence-by-g-w-smith/">"Art and Artificial Intelligence"</a>. ArtEnt. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20170625075845/http://artent.net/2015/03/27/art-and-artificial-intelligence-by-g-w-smith/">Archived</a> from the original on 25 June 2017. Retrieved 27 March 2015.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Art+and+Artificial+Intelligence&rft.pub=ArtEnt&rft.date=2015-03-27&rft.au=Smith%2C+G.+W.&rft_id=http%3A%2F%2Fartent.net%2F2015%2F03%2F27%2Fart-and-artificial-intelligence-by-g-w-smith%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-89"><a href="#cite_ref-89">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMarcus2014" class="citation magazine cs1">Marcus, Gary (9 June 2014). <a rel="nofollow" class="external text" href="https://www.newyorker.com/tech/annals-of-technology/what-comes-after-the-turing-test">"What Comes After the Turing Test?"</a>. The New Yorker. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20220101024118/https://www.newyorker.com/tech/annals-of-technology/what-comes-after-the-turing-test">Archived</a> from the original on 1 January 2022. Retrieved 16 December 2021.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+New+Yorker&rft.atitle=What+Comes+After+the+Turing+Test%3F&rft.date=2014-06-09&rft.aulast=Marcus&rft.aufirst=Gary&rft_id=https%3A%2F%2Fwww.newyorker.com%2Ftech%2Fannals-of-technology%2Fwhat-comes-after-the-turing-test&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTEShahWarwick2010j-90"><a href="#cite_ref-FOOTNOTEShahWarwick2010j_90-0">^</a> <a href="#CITEREFShahWarwick2010j">Shah & Warwick 2010j</a>. </li> <li id="cite_note-91"><a href="#cite_ref-91">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKevin_WarwickHuma_Shah2014" class="citation journal cs1">Kevin Warwick; Huma Shah (June 2014). "Human Misidentification in Turing Tests". Journal of Experimental and Theoretical Artificial Intelligence. 27 (2): 123–135. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F0952813X.2014.921734">10.1080/0952813X.2014.921734</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:45773196">45773196</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Experimental+and+Theoretical+Artificial+Intelligence&rft.atitle=Human+Misidentification+in+Turing+Tests&rft.volume=27&rft.issue=2&rft.pages=123-135&rft.date=2014-06&rft_id=info%3Adoi%2F10.1080%2F0952813X.2014.921734&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A45773196%23id-name%3DS2CID&rft.au=Kevin+Warwick&rft.au=Huma+Shah&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTESayginCicekli2002227–258-92"><a href="#cite_ref-FOOTNOTESayginCicekli2002227–258_92-0">^</a> <a href="#CITEREFSayginCicekli2002">Saygin & Cicekli 2002</a>, pp. 227–258. </li> <li id="cite_note-FOOTNOTETuring1950448-93"><a href="#cite_ref-FOOTNOTETuring1950448_93-0">^</a> <a href="#CITEREFTuring1950">Turing 1950</a>, p. 448. </li> <li id="cite_note-94"><a href="#cite_ref-94">^</a> Several alternatives to the Turing test, designed to evaluate machines more intelligent than humans: <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJose_Hernandez-Orallo2000" class="citation cs2">Jose Hernandez-Orallo (2000), "Beyond the Turing Test", Journal of Logic, Language and Information, 9 (4): 447–466, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8943">10.1.1.44.8943</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1008367325700">10.1023/A:1008367325700</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14481982">14481982</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Logic%2C+Language+and+Information&rft.atitle=Beyond+the+Turing+Test&rft.volume=9&rft.issue=4&rft.pages=447-466&rft.date=2000&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.44.8943%23id-name%3DCiteSeerX&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A14481982%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1023%2FA%3A1008367325700&rft.au=Jose+Hernandez-Orallo&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFD_L_DoweA_R_Hajek1997" class="citation cs2">D L Dowe & A R Hajek (1997), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110628194905/http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html">"A computational extension to the Turing Test"</a>, Proceedings of the 4th Conference of the Australasian Cognitive Science Society, archived from <a rel="nofollow" class="external text" href="http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html">the original</a> on 28 June 2011, retrieved 21 July 2009.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+4th+Conference+of+the+Australasian+Cognitive+Science+Society&rft.atitle=A+computational+extension+to+the+Turing+Test&rft.date=1997&rft.au=D+L+Dowe&rft.au=A+R+Hajek&rft_id=http%3A%2F%2Fwww.csse.monash.edu.au%2Fpublications%2F1997%2Ftr-cs97-322-abs.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShane_LeggMarcus_Hutter2007" class="citation cs2">Shane Legg & Marcus Hutter (2007), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090618152351/http://www.vetta.org/documents/UniversalIntelligence.pdf">"Universal Intelligence: A Definition of Machine Intelligence"</a> (PDF), Minds and Machines, 17 (4): 391–444, <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<a rel="nofollow" class="external text" href="https://arxiv.org/abs/0712.3329">0712.3329</a>, <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2007arXiv0712.3329L">2007arXiv0712.3329L</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs11023-007-9079-x">10.1007/s11023-007-9079-x</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:847021">847021</a>, archived from <a rel="nofollow" class="external text" href="http://www.vetta.org/documents/UniversalIntelligence.pdf">the original</a> (PDF) on 18 June 2009, retrieved 21 July 2009.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Universal+Intelligence%3A+A+Definition+of+Machine+Intelligence&rft.volume=17&rft.issue=4&rft.pages=391-444&rft.date=2007&rft_id=info%3Aarxiv%2F0712.3329&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A847021%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1007%2Fs11023-007-9079-x&rft_id=info%3Abibcode%2F2007arXiv0712.3329L&rft.au=Shane+Legg&rft.au=Marcus+Hutter&rft_id=http%3A%2F%2Fwww.vetta.org%2Fdocuments%2FUniversalIntelligence.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHernandez-OralloDowe2010" class="citation cs2">Hernandez-Orallo, J; Dowe, D L (2010), "Measuring Universal Intelligence: Towards an Anytime Intelligence Test", Artificial Intelligence, 174 (18): 1508–1539, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2Fj.artint.2010.09.006">10.1016/j.artint.2010.09.006</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Artificial+Intelligence&rft.atitle=Measuring+Universal+Intelligence%3A+Towards+an+Anytime+Intelligence+Test&rft.volume=174&rft.issue=18&rft.pages=1508-1539&rft.date=2010&rft_id=info%3Adoi%2F10.1016%2Fj.artint.2010.09.006&rft.aulast=Hernandez-Orallo&rft.aufirst=J&rft.au=Dowe%2C+D+L&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li></ul> </li> <li id="cite_note-95"><a href="#cite_ref-95">^</a> <a href="#CITEREFRussellNorvig2003">Russell & Norvig (2003</a>, pp. 958–960) identify Searle's argument with the one Turing answers. </li> <li id="cite_note-FOOTNOTETuring1950-96"><a href="#cite_ref-FOOTNOTETuring1950_96-0">^</a> <a href="#CITEREFTuring1950">Turing 1950</a>. </li> <li id="cite_note-FOOTNOTERussellNorvig20033-97">^ <a href="#cite_ref-FOOTNOTERussellNorvig20033_97-0">a</a> <a href="#cite_ref-FOOTNOTERussellNorvig20033_97-1">b</a> <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, p. 3. </li> <li id="cite_note-98"><a href="#cite_ref-98">^</a> <a href="#CITEREFTuring1950">Turing 1950</a>, under the heading "The Imitation Game," where he writes, "Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words." </li> <li id="cite_note-99"><a href="#cite_ref-99">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMcCarthy1996" class="citation cs2"><a href="/wiki/John_McCarthy_(computer_scientist)" title="John McCarthy (computer scientist)">McCarthy, John</a> (1996), <a rel="nofollow" class="external text" href="http://www-formal.stanford.edu/jmc/aiphil/node2.html#SECTION00020000000000000000">"The Philosophy of Artificial Intelligence"</a>, What has AI in Common with Philosophy?, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190405214706/http://www-formal.stanford.edu/jmc/aiphil/node2.html#SECTION00020000000000000000">archived</a> from the original on 5 April 2019, retrieved 26 February 2009</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=What+has+AI+in+Common+with+Philosophy%3F&rft.atitle=The+Philosophy+of+Artificial+Intelligence&rft.date=1996&rft.aulast=McCarthy&rft.aufirst=John&rft_id=http%3A%2F%2Fwww-formal.stanford.edu%2Fjmc%2Faiphil%2Fnode2.html%23SECTION00020000000000000000&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-100"><a href="#cite_ref-100">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrynjolfsson2022" class="citation journal cs1">Brynjolfsson, Erik (1 May 2022). <a rel="nofollow" class="external text" href="https://doi.org/10.1162%2Fdaed_a_01915">"The Turing Trap: The Promise & Peril of Human-Like Artificial Intelligence"</a>. Daedalus. 151 (2): 272–287. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1162%2Fdaed_a_01915">10.1162/daed_a_01915</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Daedalus&rft.atitle=The+Turing+Trap%3A+The+Promise+%26+Peril+of+Human-Like+Artificial+Intelligence&rft.volume=151&rft.issue=2&rft.pages=272-287&rft.date=2022-05-01&rft_id=info%3Adoi%2F10.1162%2Fdaed_a_01915&rft.aulast=Brynjolfsson&rft.aufirst=Erik&rft_id=https%3A%2F%2Fdoi.org%2F10.1162%252Fdaed_a_01915&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-101"><a href="#cite_ref-101">^</a> Gardner, H. (2011). Frames of mind: The theory of multiple intelligences. Hachette Uk </li> <li id="cite_note-102"><a href="#cite_ref-102">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWarwickShah2017" class="citation journal cs1">Warwick, Kevin; Shah, Huma (4 March 2017). <a rel="nofollow" class="external text" href="https://curve.coventry.ac.uk/open/items/9490ae0b-63a1-4427-871e-017cfaa2fe7e/1/Taking+the+Fifth+-+complete.pdf">"Taking the fifth amendment in Turing's imitation game"</a> (PDF). Journal of Experimental & Theoretical Artificial Intelligence. 29 (2): 287–297. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2017JETAI..29..287W">2017JETAI..29..287W</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F0952813X.2015.1132273">10.1080/0952813X.2015.1132273</a>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0952-813X">0952-813X</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:205634569">205634569</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Experimental+%26+Theoretical+Artificial+Intelligence&rft.atitle=Taking+the+fifth+amendment+in+Turing%27s+imitation+game&rft.volume=29&rft.issue=2&rft.pages=287-297&rft.date=2017-03-04&rft_id=info%3Adoi%2F10.1080%2F0952813X.2015.1132273&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A205634569%23id-name%3DS2CID&rft.issn=0952-813X&rft_id=info%3Abibcode%2F2017JETAI..29..287W&rft.aulast=Warwick&rft.aufirst=Kevin&rft.au=Shah%2C+Huma&rft_id=https%3A%2F%2Fcurve.coventry.ac.uk%2Fopen%2Fitems%2F9490ae0b-63a1-4427-871e-017cfaa2fe7e%2F1%2FTaking%2Bthe%2BFifth%2B-%2Bcomplete.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">[<a href="/wiki/Wikipedia:Link_rot" title="Wikipedia:Link rot">permanent dead link</a>‍] </li> <li id="cite_note-103"><a href="#cite_ref-103">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWarwickShah2015" class="citation journal cs1">Warwick, Kevin; Shah, Huma (4 March 2015). "Human misidentification in Turing tests". Journal of Experimental & Theoretical Artificial Intelligence. 27 (2): 123–135. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F0952813X.2014.921734">10.1080/0952813X.2014.921734</a>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0952-813X">0952-813X</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:45773196">45773196</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Experimental+%26+Theoretical+Artificial+Intelligence&rft.atitle=Human+misidentification+in+Turing+tests&rft.volume=27&rft.issue=2&rft.pages=123-135&rft.date=2015-03-04&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A45773196%23id-name%3DS2CID&rft.issn=0952-813X&rft_id=info%3Adoi%2F10.1080%2F0952813X.2014.921734&rft.aulast=Warwick&rft.aufirst=Kevin&rft.au=Shah%2C+Huma&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-104"><a href="#cite_ref-104">^</a> <a rel="nofollow" class="external text" href="https://digitaleconomy.stanford.edu/news/the-turing-trap-the-promise-peril-of-human-like-artificial-intelligence/">The Turing Trap</a> </li> <li id="cite_note-FOOTNOTEBion1979-105"><a href="#cite_ref-FOOTNOTEBion1979_105-0">^</a> <a href="#CITEREFBion1979">Bion 1979</a>. </li> <li id="cite_note-FOOTNOTEHinshelwood2001-106"><a href="#cite_ref-FOOTNOTEHinshelwood2001_106-0">^</a> <a href="#CITEREFHinshelwood2001">Hinshelwood 2001</a>. </li> <li id="cite_note-107"><a href="#cite_ref-107">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMalikMori" class="citation cs2"><a href="/wiki/Jitendra_Malik" title="Jitendra Malik">Malik, Jitendra</a>; Mori, Greg, <a rel="nofollow" class="external text" href="http://www.cs.sfu.ca/~mori/research/gimpy/">Breaking a Visual CAPTCHA</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061739/http://www.cs.sfu.ca/~mori/research/gimpy/">archived</a> from the original on 23 March 2019, retrieved 21 November 2009</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Breaking+a+Visual+CAPTCHA&rft.aulast=Malik&rft.aufirst=Jitendra&rft.au=Mori%2C+Greg&rft_id=http%3A%2F%2Fwww.cs.sfu.ca%2F~mori%2Fresearch%2Fgimpy%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-108"><a href="#cite_ref-108">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPachal" class="citation cs2">Pachal, Pete, <a rel="nofollow" class="external text" href="http://mashable.com/2013/10/28/captcha-defeated/#QyX1ZwnE9sqr">Captcha FAIL: Researchers Crack the Web's Most Popular Turing Test</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20181203140616/https://mashable.com/2013/10/28/captcha-defeated/#QyX1ZwnE9sqr">archived</a> from the original on 3 December 2018, retrieved 31 December 2015</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Captcha+FAIL%3A+Researchers+Crack+the+Web%27s+Most+Popular+Turing+Test&rft.aulast=Pachal&rft.aufirst=Pete&rft_id=http%3A%2F%2Fmashable.com%2F2013%2F10%2F28%2Fcaptcha-defeated%2F%23QyX1ZwnE9sqr&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-109"><a href="#cite_ref-109">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTung" class="citation cs2">Tung, Liam, <a rel="nofollow" class="external text" href="https://www.zdnet.com/article/google-algorithm-busts-captcha-with-99-8-percent-accuracy/">Google algorithm busts CAPTCHA with 99.8 percent accuracy</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061748/https://www.zdnet.com/article/google-algorithm-busts-captcha-with-99-8-percent-accuracy/">archived</a> from the original on 23 March 2019, retrieved 31 December 2015</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Google+algorithm+busts+CAPTCHA+with+99.8+percent+accuracy&rft.aulast=Tung&rft.aufirst=Liam&rft_id=https%3A%2F%2Fwww.zdnet.com%2Farticle%2Fgoogle-algorithm-busts-captcha-with-99-8-percent-accuracy%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-110"><a href="#cite_ref-110">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGhosemajumder" class="citation cs2">Ghosemajumder, Shuman, <a rel="nofollow" class="external text" href="http://www.infoq.com/presentations/ai-security">The Imitation Game: The New Frontline of Security</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061742/https://www.infoq.com/presentations/ai-security">archived</a> from the original on 23 March 2019, retrieved 31 December 2015</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Imitation+Game%3A+The+New+Frontline+of+Security&rft.aulast=Ghosemajumder&rft.aufirst=Shuman&rft_id=http%3A%2F%2Fwww.infoq.com%2Fpresentations%2Fai-security&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-111"><a href="#cite_ref-111">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSchwaninger2022" class="citation cs2"><a href="/w/index.php?title=Arthur_C._Schwaninger&action=edit&redlink=1" class="new" title="Arthur C. Schwaninger (page does not exist)">Schwaninger, Arthur C.</a> (2022), "The Philosophising Machine – a Specification of the Turing Test", Philosophia, 50 (3): 1437–1453, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs11406-022-00480-5">10.1007/s11406-022-00480-5</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:247282718">247282718</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Philosophia&rft.atitle=The+Philosophising+Machine+%E2%80%93+a+Specification+of+the+Turing+Test&rft.volume=50&rft.issue=3&rft.pages=1437-1453&rft.date=2022&rft_id=info%3Adoi%2F10.1007%2Fs11406-022-00480-5&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A247282718%23id-name%3DS2CID&rft.aulast=Schwaninger&rft.aufirst=Arthur+C.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-112"><a href="#cite_ref-112">^</a> <a href="#CITEREFMcCorduck2004">McCorduck 2004</a>, pp. 503–505, <a href="#CITEREFFeigenbaum2003">Feigenbaum 2003</a>. The subject matter expert test is also mentioned in <a href="#CITEREFKurzweil2005">Kurzweil (2005)</a> </li> <li id="cite_note-113"><a href="#cite_ref-113">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFrench" class="citation cs2"><a href="/wiki/Robert_M._French" title="Robert M. French">French, Robert M.</a>, "Subcognition and the Limits of the Turing Test", Mind, 99 (393): 53–65</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Mind&rft.atitle=Subcognition+and+the+Limits+of+the+Turing+Test&rft.volume=99&rft.issue=393&rft.pages=53-65&rft.aulast=French&rft.aufirst=Robert+M.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-114"><a href="#cite_ref-114">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGent2014" class="citation cs2">Gent, Edd (2014), <a rel="nofollow" class="external text" href="https://eandt.theiet.org/content/articles/2014/11/the-turing-test-brain-inspired-computings-multiple-path-approach/">The Turing Test: brain-inspired computing's multiple-path approach</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190323061739/https://eandt.theiet.org/content/articles/2014/11/the-turing-test-brain-inspired-computings-multiple-path-approach/">archived</a> from the original on 23 March 2019, retrieved 18 October 2018</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Turing+Test%3A+brain-inspired+computing%27s+multiple-path+approach&rft.date=2014&rft.aulast=Gent&rft.aufirst=Edd&rft_id=https%3A%2F%2Feandt.theiet.org%2Fcontent%2Farticles%2F2014%2F11%2Fthe-turing-test-brain-inspired-computings-multiple-path-approach%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTERussellNorvig20103-115"><a href="#cite_ref-FOOTNOTERussellNorvig20103_115-0">^</a> <a href="#CITEREFRussellNorvig2010">Russell & Norvig 2010</a>, p. 3. </li> <li id="cite_note-116"><a href="#cite_ref-116">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCacm_Staff2017" class="citation journal cs1">Cacm Staff (2017). "A leap from artificial to intelligence". Communications of the ACM. 61: 10–11. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F3168260">10.1145/3168260</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Communications+of+the+ACM&rft.atitle=A+leap+from+artificial+to+intelligence&rft.volume=61&rft.pages=10-11&rft.date=2017&rft_id=info%3Adoi%2F10.1145%2F3168260&rft.au=Cacm+Staff&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-117"><a href="#cite_ref-117">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://archive.today/20130630171858/http://tech.groups.yahoo.com/group/arcondev/message/337">"Arcondev : Message: Re: [arcondev] MIST = fog?"</a>. Archived from <a rel="nofollow" class="external text" href="http://tech.groups.yahoo.com/group/arcondev/message/337">the original</a> on 30 June 2013. Retrieved 28 December 2023.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Arcondev+%3A+Message%3A+Re%3A+%26%2391%3Barcondev%26%2393%3B+MIST+%3D+fog%3F&rft_id=http%3A%2F%2Ftech.groups.yahoo.com%2Fgroup%2Farcondev%2Fmessage%2F337&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-118"><a href="#cite_ref-118">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMcKinstry1997" class="citation cs2"><a href="/wiki/Chris_McKinstry" title="Chris McKinstry">McKinstry, Chris</a> (1997), <a rel="nofollow" class="external text" href="http://hps.elte.hu/~gk/Loebner/kcm9512.htm">"Minimum Intelligent Signal Test: An Alternative Turing Test"</a>, Canadian Artificial Intelligence (41), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190331081116/http://hps.elte.hu/~gk/Loebner/kcm9512.htm">archived</a> from the original on 31 March 2019, retrieved 4 May 2011</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Canadian+Artificial+Intelligence&rft.atitle=Minimum+Intelligent+Signal+Test%3A+An+Alternative+Turing+Test&rft.issue=41&rft.date=1997&rft.aulast=McKinstry&rft.aufirst=Chris&rft_id=http%3A%2F%2Fhps.elte.hu%2F~gk%2FLoebner%2Fkcm9512.htm&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-119"><a href="#cite_ref-119">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFD_L_DoweA_R_Hajek1997" class="citation cs2">D L Dowe & A R Hajek (1997), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110628194905/http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html">"A computational extension to the Turing Test"</a>, Proceedings of the 4th Conference of the Australasian Cognitive Science Society, archived from <a rel="nofollow" class="external text" href="http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html">the original</a> on 28 June 2011, retrieved 21 July 2009.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+4th+Conference+of+the+Australasian+Cognitive+Science+Society&rft.atitle=A+computational+extension+to+the+Turing+Test&rft.date=1997&rft.au=D+L+Dowe&rft.au=A+R+Hajek&rft_id=http%3A%2F%2Fwww.csse.monash.edu.au%2Fpublications%2F1997%2Ftr-cs97-322-abs.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-120"><a href="#cite_ref-120">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJose_Hernandez-Orallo2000" class="citation cs2">Jose Hernandez-Orallo (2000), "Beyond the Turing Test", Journal of Logic, Language and Information, 9 (4): 447–466, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8943">10.1.1.44.8943</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1008367325700">10.1023/A:1008367325700</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14481982">14481982</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Logic%2C+Language+and+Information&rft.atitle=Beyond+the+Turing+Test&rft.volume=9&rft.issue=4&rft.pages=447-466&rft.date=2000&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.44.8943%23id-name%3DCiteSeerX&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A14481982%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1023%2FA%3A1008367325700&rft.au=Jose+Hernandez-Orallo&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTEHernandez-OralloDowe2010-121"><a href="#cite_ref-FOOTNOTEHernandez-OralloDowe2010_121-0">^</a> <a href="#CITEREFHernandez-OralloDowe2010">Hernandez-Orallo & Dowe 2010</a>. </li> <li id="cite_note-122"><a href="#cite_ref-122">^</a> An Approximation of the Universal Intelligence Measure, Shane Legg and Joel Veness, 2011 Solomonoff Memorial Conference </li> <li id="cite_note-twsL37-123"><a href="#cite_ref-twsL37_123-0">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAlex_Pasternack2011" class="citation news cs1">Alex_Pasternack (18 April 2011). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110906063605/http://motherboard.tv/2011/4/18/a-macbook-may-have-given-roger-ebert-his-voice-but-an-ipod-saved-his-life-video">"A MacBook May Have Given Roger Ebert His Voice, But An iPod Saved His Life (Video)"</a>. Motherboard. Archived from <a rel="nofollow" class="external text" href="http://www.motherboard.tv/2011/4/18/a-macbook-may-have-given-roger-ebert-his-voice-but-an-ipod-saved-his-life-video">the original</a> on 6 September 2011. Retrieved 12 September 2011. <q>He calls it the "Ebert Test," after Turing's AI standard...</q></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+MacBook+May+Have+Given+Roger+Ebert+His+Voice%2C+But+An+iPod+Saved+His+Life+%28Video%29&rft.date=2011-04-18&rft.au=Alex_Pasternack&rft_id=http%3A%2F%2Fwww.motherboard.tv%2F2011%2F4%2F18%2Fa-macbook-may-have-given-roger-ebert-his-voice-but-an-ipod-saved-his-life-video&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-124"><a href="#cite_ref-124">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKey2023" class="citation web cs1">Key, Alys (21 April 2023). <a rel="nofollow" class="external text" href="https://www.standard.co.uk/tech/human-or-not-ai-game-robot-turing-test-b1075894.html">"Could you tell if someone was human or AI?"</a>. Evening Standard. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20230802143702/https://www.standard.co.uk/tech/human-or-not-ai-game-robot-turing-test-b1075894.html">Archived</a> from the original on 2 August 2023. Retrieved 2 August 2023.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Evening+Standard&rft.atitle=Could+you+tell+if+someone+was+human+or+AI%3F&rft.date=2023-04-21&rft.aulast=Key&rft.aufirst=Alys&rft_id=https%3A%2F%2Fwww.standard.co.uk%2Ftech%2Fhuman-or-not-ai-game-robot-turing-test-b1075894.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-125"><a href="#cite_ref-125">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.newscientist.com/article/2376899-massive-turing-test-shows-we-can-only-just-tell-ais-apart-from-humans/">"Massive Turing test shows we can only just tell AIs apart from humans"</a>. New Scientist. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240722040929/https://www.newscientist.com/article/2376899-massive-turing-test-shows-we-can-only-just-tell-ais-apart-from-humans/">Archived</a> from the original on 22 July 2024. Retrieved 2 August 2023.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=New+Scientist&rft.atitle=Massive+Turing+test+shows+we+can+only+just+tell+AIs+apart+from+humans&rft_id=https%3A%2F%2Fwww.newscientist.com%2Farticle%2F2376899-massive-turing-test-shows-we-can-only-just-tell-ais-apart-from-humans%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-126"><a href="#cite_ref-126">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBiever2023" class="citation journal cs1">Biever, Celeste (25 July 2023). <a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fd41586-023-02361-7">"ChatGPT broke the Turing test — the race is on for new ways to assess AI"</a>. Nature. 619 (7971): 686–689. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2023Natur.619..686B">2023Natur.619..686B</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fd41586-023-02361-7">10.1038/d41586-023-02361-7</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/37491395">37491395</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Nature&rft.atitle=ChatGPT+broke+the+Turing+test+%E2%80%94+the+race+is+on+for+new+ways+to+assess+AI&rft.volume=619&rft.issue=7971&rft.pages=686-689&rft.date=2023-07-25&rft_id=info%3Apmid%2F37491395&rft_id=info%3Adoi%2F10.1038%2Fd41586-023-02361-7&rft_id=info%3Abibcode%2F2023Natur.619..686B&rft.aulast=Biever&rft.aufirst=Celeste&rft_id=https%3A%2F%2Fdoi.org%2F10.1038%252Fd41586-023-02361-7&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-127"><a href="#cite_ref-127">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.zdnet.com/article/can-you-distinguish-people-from-ai-bots-human-or-not-online-game-reveals-results/">"Can you distinguish people from AI bots? 'Human or not' online game reveals results"</a>. ZDNET. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240506000924/https://www.zdnet.com/article/can-you-distinguish-people-from-ai-bots-human-or-not-online-game-reveals-results/">Archived</a> from the original on 6 May 2024. Retrieved 2 August 2023.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=ZDNET&rft.atitle=Can+you+distinguish+people+from+AI+bots%3F+%27Human+or+not%27+online+game+reveals+results&rft_id=https%3A%2F%2Fwww.zdnet.com%2Farticle%2Fcan-you-distinguish-people-from-ai-bots-human-or-not-online-game-reveals-results%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-128"><a href="#cite_ref-128">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPress" class="citation web cs1">Press, Gil. <a rel="nofollow" class="external text" href="https://www.forbes.com/sites/gilpress/2023/06/01/is-it-an-ai-chatbot-or-a-human-32-cant-tell/">"Is It An AI Chatbot Or A Human? 32% Can't Tell"</a>. Forbes. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20240709171615/https://www.forbes.com/sites/gilpress/2023/06/01/is-it-an-ai-chatbot-or-a-human-32-cant-tell/">Archived</a> from the original on 9 July 2024. Retrieved 2 August 2023.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Forbes&rft.atitle=Is+It+An+AI+Chatbot+Or+A+Human%3F+32%25+Can%27t+Tell&rft.aulast=Press&rft.aufirst=Gil&rft_id=https%3A%2F%2Fwww.forbes.com%2Fsites%2Fgilpress%2F2023%2F06%2F01%2Fis-it-an-ai-chatbot-or-a-human-32-cant-tell%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> <li id="cite_note-FOOTNOTEWhitby199653-129"><a href="#cite_ref-FOOTNOTEWhitby199653_129-0">^</a> <a href="#CITEREFWhitby1996">Whitby 1996</a>, p. 53. </li> <li id="cite_note-130"><a href="#cite_ref-130">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation cs2"><a rel="nofollow" class="external text" href="http://www.reading.ac.uk/cirg/loebner/cirg-loebner-main.asp">Loebner Prize 2008</a>, University of Reading, retrieved 29 March 2009</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Loebner+Prize+2008&rft.pub=University+of+Reading&rft_id=http%3A%2F%2Fwww.reading.ac.uk%2Fcirg%2Floebner%2Fcirg-loebner-main.asp&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">[<a href="/wiki/Wikipedia:Link_rot" title="Wikipedia:Link rot">permanent dead link</a>‍] </li> <li id="cite_note-131"><a href="#cite_ref-131">^</a> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20090318025939/http://aisb.org.uk/events/turingevent.shtml">AISB 2008 Symposium on the Turing Test</a>, Society for the Study of Artificial Intelligence and the Simulation of Behaviour, archived from <a rel="nofollow" class="external text" href="http://www.aisb.org.uk/events/turingevent.shtml">the original</a> on 18 March 2009, retrieved 29 March 2009</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=AISB+2008+Symposium+on+the+Turing+Test&rft.pub=Society+for+the+Study+of+Artificial+Intelligence+and+the+Simulation+of+Behaviour&rft_id=http%3A%2F%2Fwww.aisb.org.uk%2Fevents%2Fturingevent.shtml&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> </li> </ol></div> <div class="mw-heading mw-heading2"><h2 id="References">References</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=47" title="Edit section: References">edit</a>]</div> <style data-mw-deduplicate="TemplateStyles:r1239549316">.mw-parser-output .refbegin{margin-bottom:0.5em}.mw-parser-output .refbegin-hanging-indents>ul{margin-left:0}.mw-parser-output .refbegin-hanging-indents>ul>li{margin-left:0;padding-left:3.2em;text-indent:-3.2em}.mw-parser-output .refbegin-hanging-indents ul,.mw-parser-output .refbegin-hanging-indents ul li{list-style:none}@media(max-width:720px){.mw-parser-output .refbegin-hanging-indents>ul>li{padding-left:1.6em;text-indent:-1.6em}}.mw-parser-output .refbegin-columns{margin-top:0.3em}.mw-parser-output .refbegin-columns ul{margin-top:0}.mw-parser-output .refbegin-columns li{page-break-inside:avoid;break-inside:avoid-column}@media screen{.mw-parser-output .refbegin{font-size:90%}}</style><div class="refbegin refbegin-columns references-column-width" style="column-width: 30em"> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBion1979" class="citation cs2">Bion, W.S. (1979), "Making the best of a bad job", Clinical Seminars and Four Papers, Abingdon: Fleetwood Press.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Making+the+best+of+a+bad+job&rft.btitle=Clinical+Seminars+and+Four+Papers&rft.pub=Abingdon%3A+Fleetwood+Press.&rft.date=1979&rft.aulast=Bion&rft.aufirst=W.S.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBoden2006" class="citation cs2"><a href="/wiki/Margaret_A._Boden" class="mw-redirect" title="Margaret A. Boden">Boden, Margaret A.</a> (2006), <a rel="nofollow" class="external text" href="https://archive.org/details/mindasmachinehis0001bode">Mind As Machine: A History of Cognitive Science</a>, <a href="/wiki/Oxford_University_Press" title="Oxford University Press">Oxford University Press</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-19-924144-6" title="Special:BookSources/978-0-19-924144-6"><bdi>978-0-19-924144-6</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Mind+As+Machine%3A+A+History+of+Cognitive+Science&rft.pub=Oxford+University+Press&rft.date=2006&rft.isbn=978-0-19-924144-6&rft.aulast=Boden&rft.aufirst=Margaret+A.&rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fmindasmachinehis0001bode&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFColbyHilfWeberKraemer1972" class="citation cs2">Colby, K. M.; Hilf, F. D.; Weber, S.; Kraemer, H. (1972), "Turing-like indistinguishability tests for the validation of a computer simulation of paranoid processes", <a href="/wiki/Artificial_Intelligence_(journal)" title="Artificial Intelligence (journal)">Artificial Intelligence</a>, 3: 199–221, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2F0004-3702%2872%2990049-5">10.1016/0004-3702(72)90049-5</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Artificial+Intelligence&rft.atitle=Turing-like+indistinguishability+tests+for+the+validation+of+a+computer+simulation+of+paranoid+processes&rft.volume=3&rft.pages=199-221&rft.date=1972&rft_id=info%3Adoi%2F10.1016%2F0004-3702%2872%2990049-5&rft.aulast=Colby&rft.aufirst=K.+M.&rft.au=Hilf%2C+F.+D.&rft.au=Weber%2C+S.&rft.au=Kraemer%2C+H.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCopeland2003" class="citation cs2"><a href="/wiki/Jack_Copeland" title="Jack Copeland">Copeland, Jack</a> (2003), Moor, James (ed.), "The Turing Test", The Turing Test: The Elusive Standard of Artificial Intelligence, Springer, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-4020-1205-1" title="Special:BookSources/978-1-4020-1205-1"><bdi>978-1-4020-1205-1</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+Turing+Test%3A+The+Elusive+Standard+of+Artificial+Intelligence&rft.atitle=The+Turing+Test&rft.date=2003&rft.isbn=978-1-4020-1205-1&rft.aulast=Copeland&rft.aufirst=Jack&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCrevier1993" class="citation cs2"><a href="/wiki/Daniel_Crevier" title="Daniel Crevier">Crevier, Daniel</a> (1993), AI: The Tumultuous Search for Artificial Intelligence, New York, NY: BasicBooks, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-465-02997-6" title="Special:BookSources/978-0-465-02997-6"><bdi>978-0-465-02997-6</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=AI%3A+The+Tumultuous+Search+for+Artificial+Intelligence&rft.place=New+York%2C+NY&rft.pub=BasicBooks&rft.date=1993&rft.isbn=978-0-465-02997-6&rft.aulast=Crevier&rft.aufirst=Daniel&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDanziger2022" class="citation cs2">Danziger, Shlomo (2022), "Intelligence as a Social Concept: a Socio-Technological Interpretation of the Turing Test", Philosophy & Technology, 35 (3): 68, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs13347-022-00561-z">10.1007/s13347-022-00561-z</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:251000575">251000575</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Philosophy+%26+Technology&rft.atitle=Intelligence+as+a+Social+Concept%3A+a+Socio-Technological+Interpretation+of+the+Turing+Test&rft.volume=35&rft.issue=3&rft.pages=68&rft.date=2022&rft_id=info%3Adoi%2F10.1007%2Fs13347-022-00561-z&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A251000575%23id-name%3DS2CID&rft.aulast=Danziger&rft.aufirst=Shlomo&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDescartes1996" class="citation book cs1">Descartes, René (1996). <a rel="nofollow" class="external text" href="https://archive.org/details/discourseonmetho0000desc_i4z8">Discourse on Method and Meditations on First Philosophy</a>. New Haven & London: Yale University Press. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-300-06772-9" title="Special:BookSources/978-0-300-06772-9"><bdi>978-0-300-06772-9</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Discourse+on+Method+and+Meditations+on+First+Philosophy&rft.place=New+Haven+%26+London&rft.pub=Yale+University+Press&rft.date=1996&rft.isbn=978-0-300-06772-9&rft.aulast=Descartes&rft.aufirst=Ren%C3%A9&rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fdiscourseonmetho0000desc_i4z8&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDiderot2007" class="citation cs2"><a href="/wiki/Denis_Diderot" title="Denis Diderot">Diderot, D.</a> (2007), Pensees Philosophiques, Addition aux Pensees Philosophiques, [Flammarion], <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-2-0807-1249-3" title="Special:BookSources/978-2-0807-1249-3"><bdi>978-2-0807-1249-3</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Pensees+Philosophiques%2C+Addition+aux+Pensees+Philosophiques&rft.pub=%5BFlammarion%5D&rft.date=2007&rft.isbn=978-2-0807-1249-3&rft.aulast=Diderot&rft.aufirst=D.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDreyfus1979" class="citation cs2"><a href="/wiki/Hubert_Dreyfus" title="Hubert Dreyfus">Dreyfus, Hubert</a> (1979), <a rel="nofollow" class="external text" href="https://archive.org/details/whatcomputerscan00hube">What Computers Still Can't Do</a>, New York: MIT Press, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-06-090613-9" title="Special:BookSources/978-0-06-090613-9"><bdi>978-0-06-090613-9</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=What+Computers+Still+Can%27t+Do&rft.place=New+York&rft.pub=MIT+Press&rft.date=1979&rft.isbn=978-0-06-090613-9&rft.aulast=Dreyfus&rft.aufirst=Hubert&rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fwhatcomputerscan00hube&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFeigenbaum2003" class="citation cs2"><a href="/wiki/Edward_Feigenbaum" title="Edward Feigenbaum">Feigenbaum, Edward A.</a> (2003), "Some challenges and grand challenges for computational intelligence", Journal of the ACM, 50 (1): 32–40, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F602382.602400">10.1145/602382.602400</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:15379263">15379263</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+the+ACM&rft.atitle=Some+challenges+and+grand+challenges+for+computational+intelligence&rft.volume=50&rft.issue=1&rft.pages=32-40&rft.date=2003&rft_id=info%3Adoi%2F10.1145%2F602382.602400&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A15379263%23id-name%3DS2CID&rft.aulast=Feigenbaum&rft.aufirst=Edward+A.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFrench1990" class="citation cs2"><a href="/wiki/Robert_M._French" title="Robert M. French">French, Robert M.</a> (1990), "Subcognition and the Limits of the Turing Test", Mind, 99 (393): 53–65, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1093%2Fmind%2Fxcix.393.53">10.1093/mind/xcix.393.53</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:38063853">38063853</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Mind&rft.atitle=Subcognition+and+the+Limits+of+the+Turing+Test&rft.volume=99&rft.issue=393&rft.pages=53-65&rft.date=1990&rft_id=info%3Adoi%2F10.1093%2Fmind%2Fxcix.393.53&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A38063853%23id-name%3DS2CID&rft.aulast=French&rft.aufirst=Robert+M.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGenova1994" class="citation cs2">Genova, J. (1994), "Turing's Sexual Guessing Game", Social Epistemology, 8 (4): 314–326, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F02691729408578758">10.1080/02691729408578758</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Social+Epistemology&rft.atitle=Turing%27s+Sexual+Guessing+Game&rft.volume=8&rft.issue=4&rft.pages=314-326&rft.date=1994&rft_id=info%3Adoi%2F10.1080%2F02691729408578758&rft.aulast=Genova&rft.aufirst=J.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGonçalves2023a" class="citation cs2">Gonçalves, Bernardo (2023a), "Galilean resonances: the role of experiment in Turing's construction of machine intelligence", Annals of Science, 81 (3): 359–389, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1080%2F00033790.2023.2234912">10.1080/00033790.2023.2234912</a>, <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/37466560">37466560</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Annals+of+Science&rft.atitle=Galilean+resonances%3A+the+role+of+experiment+in+Turing%27s+construction+of+machine+intelligence&rft.volume=81&rft.issue=3&rft.pages=359-389&rft.date=2023&rft_id=info%3Adoi%2F10.1080%2F00033790.2023.2234912&rft_id=info%3Apmid%2F37466560&rft.aulast=Gon%C3%A7alves&rft.aufirst=Bernardo&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGonçalves2023b" class="citation cs2">Gonçalves, Bernardo (2023b), "The Turing Test is a Thought Experiment", Minds & Machines, 33: 1–31, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs11023-022-09616-8">10.1007/s11023-022-09616-8</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+%26+Machines&rft.atitle=The+Turing+Test+is+a+Thought+Experiment&rft.volume=33&rft.pages=1-31&rft.date=2023&rft_id=info%3Adoi%2F10.1007%2Fs11023-022-09616-8&rft.aulast=Gon%C3%A7alves&rft.aufirst=Bernardo&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHarnad2004" class="citation cs2"><a href="/wiki/Stevan_Harnad" title="Stevan Harnad">Harnad, Stevan</a> (2004), "The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence", in Epstein, Robert; Peters, Grace (eds.), <a rel="nofollow" class="external text" href="http://cogprints.org/3322/">The Turing Test Sourcebook: Philosophical and Methodological Issues in the Quest for the Thinking Computer</a>, Klewer, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110706102356/http://cogprints.org/3322/">archived</a> from the original on 6 July 2011, retrieved 17 December 2005</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=The+Annotation+Game%3A+On+Turing+%281950%29+on+Computing%2C+Machinery%2C+and+Intelligence&rft.btitle=The+Turing+Test+Sourcebook%3A+Philosophical+and+Methodological+Issues+in+the+Quest+for+the+Thinking+Computer&rft.pub=Klewer&rft.date=2004&rft.aulast=Harnad&rft.aufirst=Stevan&rft_id=http%3A%2F%2Fcogprints.org%2F3322%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHaugeland1985" class="citation cs2"><a href="/wiki/John_Haugeland" title="John Haugeland">Haugeland, John</a> (1985), Artificial Intelligence: The Very Idea, Cambridge, Massachusetts: MIT Press</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Artificial+Intelligence%3A+The+Very+Idea&rft.place=Cambridge%2C+Massachusetts&rft.pub=MIT+Press&rft.date=1985&rft.aulast=Haugeland&rft.aufirst=John&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHayesFord1995" class="citation cs2">Hayes, Patrick; Ford, Kenneth (1995), "Turing Test Considered Harmful", Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI95-1), Montreal, Quebec, Canada.: 972–997</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+Fourteenth+International+Joint+Conference+on+Artificial+Intelligence+%28IJCAI95-1%29%2C+Montreal%2C+Quebec%2C+Canada.&rft.atitle=Turing+Test+Considered+Harmful&rft.pages=972-997&rft.date=1995&rft.aulast=Hayes&rft.aufirst=Patrick&rft.au=Ford%2C+Kenneth&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHeil1998" class="citation cs2">Heil, John (1998), Philosophy of Mind: A Contemporary Introduction, London and New York: Routledge, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-415-13060-8" title="Special:BookSources/978-0-415-13060-8"><bdi>978-0-415-13060-8</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Philosophy+of+Mind%3A+A+Contemporary+Introduction&rft.place=London+and+New+York&rft.pub=Routledge&rft.date=1998&rft.isbn=978-0-415-13060-8&rft.aulast=Heil&rft.aufirst=John&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHinshelwood2001" class="citation cs2">Hinshelwood, R.D. (2001), Group Mentality and Having a Mind: Reflections on Bion's work on groups and on psychosis</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Group+Mentality+and+Having+a+Mind%3A+Reflections+on+Bion%27s+work+on+groups+and+on+psychosis&rft.date=2001&rft.aulast=Hinshelwood&rft.aufirst=R.D.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKurzweil1990" class="citation cs2"><a href="/wiki/Ray_Kurzweil" title="Ray Kurzweil">Kurzweil, Ray</a> (1990), The Age of Intelligent Machines, Cambridge, Massachusetts: MIT Press, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-262-61079-7" title="Special:BookSources/978-0-262-61079-7"><bdi>978-0-262-61079-7</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Age+of+Intelligent+Machines&rft.place=Cambridge%2C+Massachusetts&rft.pub=MIT+Press&rft.date=1990&rft.isbn=978-0-262-61079-7&rft.aulast=Kurzweil&rft.aufirst=Ray&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKurzweil2005" class="citation cs2">Kurzweil, Ray (2005), <a rel="nofollow" class="external text" href="https://archive.org/details/singularityisnea00kurz">The Singularity is Near</a>, Penguin Books, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-670-03384-3" title="Special:BookSources/978-0-670-03384-3"><bdi>978-0-670-03384-3</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Singularity+is+Near&rft.pub=Penguin+Books&rft.date=2005&rft.isbn=978-0-670-03384-3&rft.aulast=Kurzweil&rft.aufirst=Ray&rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fsingularityisnea00kurz&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLoebner1994" class="citation cs2"><a href="/wiki/Hugh_Loebner" title="Hugh Loebner">Loebner, Hugh Gene</a> (1994), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20080314154148/http://loebner.net/Prizef/In-response.html">"In response"</a>, <a href="/wiki/Communications_of_the_ACM" title="Communications of the ACM">Communications of the ACM</a>, 37 (6): 79–82, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F175208.175218">10.1145/175208.175218</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:38428377">38428377</a>, archived from <a rel="nofollow" class="external text" href="http://loebner.net/Prizef/In-response.html">the original</a> on 14 March 2008, retrieved 22 March 2008</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Communications+of+the+ACM&rft.atitle=In+response&rft.volume=37&rft.issue=6&rft.pages=79-82&rft.date=1994&rft_id=info%3Adoi%2F10.1145%2F175208.175218&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A38428377%23id-name%3DS2CID&rft.aulast=Loebner&rft.aufirst=Hugh+Gene&rft_id=http%3A%2F%2Floebner.net%2FPrizef%2FIn-response.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMcCorduck2004" class="citation cs2"><a href="/wiki/Pamela_McCorduck" title="Pamela McCorduck">McCorduck, Pamela</a> (2004), Machines Who Think (2nd ed.), Natick, Massachusetts: A. K. Peters, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/1-5688-1205-1" title="Special:BookSources/1-5688-1205-1"><bdi>1-5688-1205-1</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Machines+Who+Think&rft.place=Natick%2C+Massachusetts&rft.edition=2nd&rft.pub=A.+K.+Peters&rft.date=2004&rft.isbn=1-5688-1205-1&rft.aulast=McCorduck&rft.aufirst=Pamela&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoor2003" class="citation cs2">Moor, James, ed. (2003), The Turing Test: The Elusive Standard of Artificial Intelligence, Dordrecht: Kluwer Academic Publishers, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-4020-1205-1" title="Special:BookSources/978-1-4020-1205-1"><bdi>978-1-4020-1205-1</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Turing+Test%3A+The+Elusive+Standard+of+Artificial+Intelligence&rft.place=Dordrecht&rft.pub=Kluwer+Academic+Publishers&rft.date=2003&rft.isbn=978-1-4020-1205-1&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPenrose1989" class="citation cs2"><a href="/wiki/Roger_Penrose" title="Roger Penrose">Penrose, Roger</a> (1989), <a href="/wiki/The_Emperor%27s_New_Mind" title="The Emperor's New Mind">The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics</a>, Oxford University Press, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-14-014534-2" title="Special:BookSources/978-0-14-014534-2"><bdi>978-0-14-014534-2</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Emperor%27s+New+Mind%3A+Concerning+Computers%2C+Minds%2C+and+The+Laws+of+Physics&rft.pub=Oxford+University+Press&rft.date=1989&rft.isbn=978-0-14-014534-2&rft.aulast=Penrose&rft.aufirst=Roger&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFProudfoot2013" class="citation cs2">Proudfoot, Diane (July 2013), "Rethinking Turing's Test", <a href="/wiki/The_Journal_of_Philosophy" title="The Journal of Philosophy">The Journal of Philosophy</a>, 110 (7): 391–411, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.5840%2Fjphil2013110722">10.5840/jphil2013110722</a>, <a href="/wiki/JSTOR_(identifier)" class="mw-redirect" title="JSTOR (identifier)">JSTOR</a> <a rel="nofollow" class="external text" href="https://www.jstor.org/stable/43820781">43820781</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+Journal+of+Philosophy&rft.atitle=Rethinking+Turing%27s+Test&rft.volume=110&rft.issue=7&rft.pages=391-411&rft.date=2013-07&rft_id=info%3Adoi%2F10.5840%2Fjphil2013110722&rft_id=https%3A%2F%2Fwww.jstor.org%2Fstable%2F43820781%23id-name%3DJSTOR&rft.aulast=Proudfoot&rft.aufirst=Diane&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRussellNorvig2003" class="citation cs2"><a href="/wiki/Stuart_J._Russell" title="Stuart J. Russell">Russell, Stuart J.</a>; <a href="/wiki/Peter_Norvig" title="Peter Norvig">Norvig, Peter</a> (2003), <a rel="nofollow" class="external text" href="http://aima.cs.berkeley.edu/">Artificial Intelligence: A Modern Approach</a> (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/0-13-790395-2" title="Special:BookSources/0-13-790395-2"><bdi>0-13-790395-2</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Artificial+Intelligence%3A+A+Modern+Approach&rft.place=Upper+Saddle+River%2C+New+Jersey&rft.edition=2nd&rft.pub=Prentice+Hall&rft.date=2003&rft.isbn=0-13-790395-2&rft.aulast=Russell&rft.aufirst=Stuart+J.&rft.au=Norvig%2C+Peter&rft_id=http%3A%2F%2Faima.cs.berkeley.edu%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRussellNorvig2010" class="citation cs2">Russell, Stuart J.; Norvig, Peter (2010), <a href="/wiki/Artificial_Intelligence:_A_Modern_Approach" title="Artificial Intelligence: A Modern Approach">Artificial Intelligence: A Modern Approach</a> (3rd ed.), Upper Saddle River, NJ: Prentice Hall, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-13-604259-4" title="Special:BookSources/978-0-13-604259-4"><bdi>978-0-13-604259-4</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Artificial+Intelligence%3A+A+Modern+Approach&rft.place=Upper+Saddle+River%2C+NJ&rft.edition=3rd&rft.pub=Prentice+Hall&rft.date=2010&rft.isbn=978-0-13-604259-4&rft.aulast=Russell&rft.aufirst=Stuart+J.&rft.au=Norvig%2C+Peter&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSaygin2000" class="citation cs2">Saygin, A. P.; Cicekli, I.; Akman, V. (2000), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110409073501/http://crl.ucsd.edu/~saygin/papers/MMTT.pdf">"Turing Test: 50 Years Later"</a> (PDF), Minds and Machines, 10 (4): 463–518, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1011288000451">10.1023/A:1011288000451</a>, <a href="/wiki/Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<a rel="nofollow" class="external text" href="https://hdl.handle.net/11693%2F24987">11693/24987</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:990084">990084</a>, archived from <a rel="nofollow" class="external text" href="http://crl.ucsd.edu/~saygin/papers/MMTT.pdf">the original</a> (PDF) on 9 April 2011, retrieved 7 January 2004</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Turing+Test%3A+50+Years+Later&rft.volume=10&rft.issue=4&rft.pages=463-518&rft.date=2000&rft_id=info%3Ahdl%2F11693%2F24987&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A990084%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1023%2FA%3A1011288000451&rft.aulast=Saygin&rft.aufirst=A.+P.&rft.au=Cicekli%2C+I.&rft.au=Akman%2C+V.&rft_id=http%3A%2F%2Fcrl.ucsd.edu%2F~saygin%2Fpapers%2FMMTT.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">. Reprinted in <a href="#CITEREFMoor2003">Moor (2003</a>, pp. 23–78).</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSayginCicekli2002" class="citation cs2">Saygin, A. P.; Cicekli, I. (2002), "Pragmatics in human-computer conversation", Journal of Pragmatics, 34 (3): 227–258, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7834">10.1.1.12.7834</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2FS0378-2166%2802%2980001-7">10.1016/S0378-2166(02)80001-7</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Pragmatics&rft.atitle=Pragmatics+in+human-computer+conversation&rft.volume=34&rft.issue=3&rft.pages=227-258&rft.date=2002&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.12.7834%23id-name%3DCiteSeerX&rft_id=info%3Adoi%2F10.1016%2FS0378-2166%2802%2980001-7&rft.aulast=Saygin&rft.aufirst=A.+P.&rft.au=Cicekli%2C+I.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSayginRobertsBeber2008" class="citation cs2">Saygin, A.P.; Roberts, Gary; Beber, Grace (2008), "Comments on "Computing Machinery and Intelligence" by Alan Turing", in Epstein, R.; Roberts, G.; Poland, G. (eds.), Parsing the Turing Test: Philosophical and Methodological Issues in the Quest for the Thinking Computer, Dordrecht, Netherlands: Springer, <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2009pttt.book.....E">2009pttt.book.....E</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-1-4020-6710-5">10.1007/978-1-4020-6710-5</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-4020-9624-2" title="Special:BookSources/978-1-4020-9624-2"><bdi>978-1-4020-9624-2</bdi></a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:60070108">60070108</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Comments+on+%22Computing+Machinery+and+Intelligence%22+by+Alan+Turing&rft.btitle=Parsing+the+Turing+Test%3A+Philosophical+and+Methodological+Issues+in+the+Quest+for+the+Thinking+Computer&rft.place=Dordrecht%2C+Netherlands&rft.pub=Springer&rft.date=2008&rft_id=info%3Adoi%2F10.1007%2F978-1-4020-6710-5&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A60070108%23id-name%3DS2CID&rft_id=info%3Abibcode%2F2009pttt.book.....E&rft.isbn=978-1-4020-9624-2&rft.aulast=Saygin&rft.aufirst=A.P.&rft.au=Roberts%2C+Gary&rft.au=Beber%2C+Grace&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSearle1980" class="citation cs2"><a href="/wiki/John_Searle" title="John Searle">Searle, John</a> (1980), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20000823030455/http://members.aol.com/NeoNoetics/MindsBrainsPrograms.html">"Minds, Brains and Programs"</a>, Behavioral and Brain Sciences, 3 (3): 417–457, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1017%2FS0140525X00005756">10.1017/S0140525X00005756</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:55303721">55303721</a>, archived from <a rel="nofollow" class="external text" href="http://members.aol.com/NeoNoetics/MindsBrainsPrograms.html">the original</a> on 23 August 2000, retrieved 19 March 2008</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Behavioral+and+Brain+Sciences&rft.atitle=Minds%2C+Brains+and+Programs&rft.volume=3&rft.issue=3&rft.pages=417-457&rft.date=1980&rft_id=info%3Adoi%2F10.1017%2FS0140525X00005756&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A55303721%23id-name%3DS2CID&rft.aulast=Searle&rft.aufirst=John&rft_id=http%3A%2F%2Fmembers.aol.com%2FNeoNoetics%2FMindsBrainsPrograms.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">. Page numbers above refer to a standard <a href="/wiki/Pdf" class="mw-redirect" title="Pdf">pdf</a> print of the article. See also Searle's <a rel="nofollow" class="external text" href="https://web.archive.org/web/20010221025515/http://www.bbsonline.org/Preprints/OldArchive/bbs.searle2.html">original draft</a>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShahWarwick2009a" class="citation cs2">Shah, Huma; <a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Warwick, Kevin</a> (2009a), "Emotion in the Turing Test: A Downward Trend for Machines in Recent Loebner Prizes", in Vallverdú, Jordi; Casacuberta, David (eds.), Handbook of Research on Synthetic Emotions and Sociable Robotics: New Applications in Affective Computing and Artificial Intelligence, Information Science, IGI, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-60566-354-8" title="Special:BookSources/978-1-60566-354-8"><bdi>978-1-60566-354-8</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Emotion+in+the+Turing+Test%3A+A+Downward+Trend+for+Machines+in+Recent+Loebner+Prizes&rft.btitle=Handbook+of+Research+on+Synthetic+Emotions+and+Sociable+Robotics%3A+New+Applications+in+Affective+Computing+and+Artificial+Intelligence&rft.pub=Information+Science%2C+IGI&rft.date=2009&rft.isbn=978-1-60566-354-8&rft.aulast=Shah&rft.aufirst=Huma&rft.au=Warwick%2C+Kevin&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShahWarwick2010a" class="citation cs2">Shah, Huma; <a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Warwick, Kevin</a> (April 2010a), "Testing Turing's five minutes, parallel-paired imitation game", Kybernetes, 4 (3): 449–465, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1108%2F03684921011036178">10.1108/03684921011036178</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Kybernetes&rft.atitle=Testing+Turing%27s+five+minutes%2C+parallel-paired+imitation+game&rft.volume=4&rft.issue=3&rft.pages=449-465&rft.date=2010-04&rft_id=info%3Adoi%2F10.1108%2F03684921011036178&rft.aulast=Shah&rft.aufirst=Huma&rft.au=Warwick%2C+Kevin&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShahWarwick2010j" class="citation cs2">Shah, Huma; <a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Warwick, Kevin</a> (June 2010j), "Hidden Interlocutor Misidentification in Practical Turing Tests", <a href="/wiki/Minds_and_Machines" title="Minds and Machines">Minds and Machines</a>, 20 (3): 441–454, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs11023-010-9219-6">10.1007/s11023-010-9219-6</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:34076187">34076187</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Hidden+Interlocutor+Misidentification+in+Practical+Turing+Tests&rft.volume=20&rft.issue=3&rft.pages=441-454&rft.date=2010-06&rft_id=info%3Adoi%2F10.1007%2Fs11023-010-9219-6&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A34076187%23id-name%3DS2CID&rft.aulast=Shah&rft.aufirst=Huma&rft.au=Warwick%2C+Kevin&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShah2011" class="citation cs2">Shah, Huma (5 April 2011), <a rel="nofollow" class="external text" href="https://www.academia.edu/474617">Turing's misunderstood imitation game and IBM's Watson success</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20230210114350/https://www.academia.edu/474617">archived</a> from the original on 10 February 2023, retrieved 20 December 2017</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Turing%27s+misunderstood+imitation+game+and+IBM%27s+Watson+success&rft.date=2011-04-05&rft.aulast=Shah&rft.aufirst=Huma&rft_id=https%3A%2F%2Fwww.academia.edu%2F474617&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShapiro1992" class="citation cs2">Shapiro, Stuart C. (1992), "The Turing Test and the economist", ACM SIGART Bulletin, 3 (4): 10–11, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F141420.141423">10.1145/141420.141423</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:27079507">27079507</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=ACM+SIGART+Bulletin&rft.atitle=The+Turing+Test+and+the+economist&rft.volume=3&rft.issue=4&rft.pages=10-11&rft.date=1992&rft_id=info%3Adoi%2F10.1145%2F141420.141423&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A27079507%23id-name%3DS2CID&rft.aulast=Shapiro&rft.aufirst=Stuart+C.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShieber1994" class="citation cs2">Shieber, Stuart M. (1994), <a rel="nofollow" class="external text" href="http://www.eecs.harvard.edu/shieber/Biblio/Papers/loebner-rev-html/loebner-rev-html.html">"Lessons from a Restricted Turing Test"</a>, <a href="/wiki/Communications_of_the_ACM" title="Communications of the ACM">Communications of the ACM</a>, 37 (6): 70–78, <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<a rel="nofollow" class="external text" href="https://arxiv.org/abs/cmp-lg/9404002">cmp-lg/9404002</a>, <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/1994cmp.lg....4002S">1994cmp.lg....4002S</a>, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.3277">10.1.1.54.3277</a>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F175208.175217">10.1145/175208.175217</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:215823854">215823854</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20080317130231/http://www.eecs.harvard.edu/shieber/Biblio/Papers/loebner-rev-html/loebner-rev-html.html">archived</a> from the original on 17 March 2008, retrieved 25 March 2008</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Communications+of+the+ACM&rft.atitle=Lessons+from+a+Restricted+Turing+Test&rft.volume=37&rft.issue=6&rft.pages=70-78&rft.date=1994&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A215823854%23id-name%3DS2CID&rft_id=info%3Abibcode%2F1994cmp.lg....4002S&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.54.3277%23id-name%3DCiteSeerX&rft_id=info%3Adoi%2F10.1145%2F175208.175217&rft_id=info%3Aarxiv%2Fcmp-lg%2F9404002&rft.aulast=Shieber&rft.aufirst=Stuart+M.&rft_id=http%3A%2F%2Fwww.eecs.harvard.edu%2Fshieber%2FBiblio%2FPapers%2Floebner-rev-html%2Floebner-rev-html.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSterrett2000" class="citation cs2">Sterrett, S. G. (2000), "Turing's Two Test of Intelligence", Minds and Machines, 10 (4): 541, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1011242120015">10.1023/A:1011242120015</a>, <a href="/wiki/Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<a rel="nofollow" class="external text" href="https://hdl.handle.net/10057%2F10701">10057/10701</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:9600264">9600264</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Turing%27s+Two+Test+of+Intelligence&rft.volume=10&rft.issue=4&rft.pages=541&rft.date=2000&rft_id=info%3Ahdl%2F10057%2F10701&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A9600264%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1023%2FA%3A1011242120015&rft.aulast=Sterrett&rft.aufirst=S.+G.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> (reprinted in The Turing Test: The Elusive Standard of Artificial Intelligence edited by James H. Moor, Kluwer Academic 2003) <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/1-4020-1205-5" title="Special:BookSources/1-4020-1205-5">1-4020-1205-5</a></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSundman2003" class="citation cs2">Sundman, John (26 February 2003), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20080307105346/http://dir.salon.com/story/tech/feature/2003/02/26/loebner_part_one/index.html">"Artificial stupidity"</a>, <a href="/wiki/Salon.com" title="Salon.com">Salon.com</a>, archived from <a rel="nofollow" class="external text" href="http://dir.salon.com/story/tech/feature/2003/02/26/loebner_part_one/index.html">the original</a> on 7 March 2008, retrieved 22 March 2008</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Salon.com&rft.atitle=Artificial+stupidity&rft.date=2003-02-26&rft.aulast=Sundman&rft.aufirst=John&rft_id=http%3A%2F%2Fdir.salon.com%2Fstory%2Ftech%2Ffeature%2F2003%2F02%2F26%2Floebner_part_one%2Findex.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFThomas1995" class="citation cs2">Thomas, Peter J. (1995), <a rel="nofollow" class="external text" href="https://archive.org/details/socialinteractio0000unse_b0z8">The Social and Interactional Dimensions of Human-Computer Interfaces</a>, <a href="/wiki/Cambridge_University_Press" title="Cambridge University Press">Cambridge University Press</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-521-45302-8" title="Special:BookSources/978-0-521-45302-8"><bdi>978-0-521-45302-8</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Social+and+Interactional+Dimensions+of+Human-Computer+Interfaces&rft.pub=Cambridge+University+Press&rft.date=1995&rft.isbn=978-0-521-45302-8&rft.aulast=Thomas&rft.aufirst=Peter+J.&rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fsocialinteractio0000unse_b0z8&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSwirski2000" class="citation cs2">Swirski, Peter (2000), Between Literature and Science: Poe, Lem, and Explorations in Aesthetics, Cognitive Science, and Literary Knowledge, <a href="/wiki/McGill-Queen%27s_University_Press" class="mw-redirect" title="McGill-Queen's University Press">McGill-Queen's University Press</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-7735-2078-3" title="Special:BookSources/978-0-7735-2078-3"><bdi>978-0-7735-2078-3</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Between+Literature+and+Science%3A+Poe%2C+Lem%2C+and+Explorations+in+Aesthetics%2C+Cognitive+Science%2C+and+Literary+Knowledge&rft.pub=McGill-Queen%27s+University+Press&rft.date=2000&rft.isbn=978-0-7735-2078-3&rft.aulast=Swirski&rft.aufirst=Peter&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTraiger2000" class="citation cs2">Traiger, Saul (2000), "Making the Right Identification in the Turing Test", Minds and Machines, 10 (4): 561, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1011254505902">10.1023/A:1011254505902</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:2302024">2302024</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=Making+the+Right+Identification+in+the+Turing+Test&rft.volume=10&rft.issue=4&rft.pages=561&rft.date=2000&rft_id=info%3Adoi%2F10.1023%2FA%3A1011254505902&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A2302024%23id-name%3DS2CID&rft.aulast=Traiger&rft.aufirst=Saul&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"> (reprinted in The Turing Test: The Elusive Standard of Artificial Intelligence edited by James H. Moor, Kluwer Academic 2003) <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/1-4020-1205-5" title="Special:BookSources/1-4020-1205-5">1-4020-1205-5</a></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuring1948" class="citation cs2"><a href="/wiki/Alan_Turing" title="Alan Turing">Turing, Alan</a> (1948), "Machine Intelligence", in Copeland, B. Jack (ed.), The Essential Turing: The ideas that gave birth to the computer age, Oxford: Oxford University Press, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-19-825080-7" title="Special:BookSources/978-0-19-825080-7"><bdi>978-0-19-825080-7</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Machine+Intelligence&rft.btitle=The+Essential+Turing%3A+The+ideas+that+gave+birth+to+the+computer+age&rft.place=Oxford&rft.pub=Oxford+University+Press&rft.date=1948&rft.isbn=978-0-19-825080-7&rft.aulast=Turing&rft.aufirst=Alan&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuring1950" class="citation journal cs1"><a href="/wiki/Alan_Turing" title="Alan Turing">Turing, Alan</a> (October 1950). <a rel="nofollow" class="external text" href="https://academic.oup.com/mind/article/LIX/236/433/986238">"Computing Machinery and Intelligence"</a>. <a href="/wiki/Mind_(journal)" title="Mind (journal)">Mind</a>. 59 (236): 433–460. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1093%2Fmind%2FLIX.236.433">10.1093/mind/LIX.236.433</a>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/1460-2113">1460-2113</a>. <a href="/wiki/JSTOR_(identifier)" class="mw-redirect" title="JSTOR (identifier)">JSTOR</a> <a rel="nofollow" class="external text" href="https://www.jstor.org/stable/2251299">2251299</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14636783">14636783</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Mind&rft.atitle=Computing+Machinery+and+Intelligence&rft.volume=59&rft.issue=236&rft.pages=433-460&rft.date=1950-10&rft.issn=1460-2113&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A14636783%23id-name%3DS2CID&rft_id=https%3A%2F%2Fwww.jstor.org%2Fstable%2F2251299%23id-name%3DJSTOR&rft_id=info%3Adoi%2F10.1093%2Fmind%2FLIX.236.433&rft.aulast=Turing&rft.aufirst=Alan&rft_id=https%3A%2F%2Facademic.oup.com%2Fmind%2Farticle%2FLIX%2F236%2F433%2F986238&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li></ul> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuring1952" class="citation cs2"><a href="/wiki/Alan_Turing" title="Alan Turing">Turing, Alan</a> (1952), "Can Automatic Calculating Machines be Said to Think?", in Copeland, B. Jack (ed.), The Essential Turing: The ideas that gave birth to the computer age, Oxford: Oxford University Press, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-19-825080-7" title="Special:BookSources/978-0-19-825080-7"><bdi>978-0-19-825080-7</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Can+Automatic+Calculating+Machines+be+Said+to+Think%3F&rft.btitle=The+Essential+Turing%3A+The+ideas+that+gave+birth+to+the+computer+age&rft.place=Oxford&rft.pub=Oxford+University+Press&rft.date=1952&rft.isbn=978-0-19-825080-7&rft.aulast=Turing&rft.aufirst=Alan&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWeizenbaum1966" class="citation cs2"><a href="/wiki/Joseph_Weizenbaum" title="Joseph Weizenbaum">Weizenbaum, Joseph</a> (January 1966), "ELIZA – A Computer Program For the Study of Natural Language Communication Between Man And Machine", <a href="/wiki/Communications_of_the_ACM" title="Communications of the ACM">Communications of the ACM</a>, 9 (1): 36–45, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F365153.365168">10.1145/365153.365168</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:1896290">1896290</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Communications+of+the+ACM&rft.atitle=ELIZA+%E2%80%93+A+Computer+Program+For+the+Study+of+Natural+Language+Communication+Between+Man+And+Machine&rft.volume=9&rft.issue=1&rft.pages=36-45&rft.date=1966-01&rft_id=info%3Adoi%2F10.1145%2F365153.365168&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A1896290%23id-name%3DS2CID&rft.aulast=Weizenbaum&rft.aufirst=Joseph&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWhitby1996" class="citation cs2">Whitby, Blay (1996), "The Turing Test: AI's Biggest Blind Alley?", in Millican, Peter; Clark, Andy (eds.), Machines and Thought: The Legacy of Alan Turing, vol. 1, <a href="/wiki/Oxford_University_Press" title="Oxford University Press">Oxford University Press</a>, pp. 53–62, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-19-823876-8" title="Special:BookSources/978-0-19-823876-8"><bdi>978-0-19-823876-8</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=The+Turing+Test%3A+AI%27s+Biggest+Blind+Alley%3F&rft.btitle=Machines+and+Thought%3A+The+Legacy+of+Alan+Turing&rft.pages=53-62&rft.pub=Oxford+University+Press&rft.date=1996&rft.isbn=978-0-19-823876-8&rft.aulast=Whitby&rft.aufirst=Blay&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZylberbergCalot2007" class="citation cs2">Zylberberg, A.; Calot, E. (2007), "Optimizing Lies in State Oriented Domains based on Genetic Algorithms", Proceedings VI Ibero-American Symposium on Software Engineering: 11–18, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-9972-2885-1-7" title="Special:BookSources/978-9972-2885-1-7"><bdi>978-9972-2885-1-7</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+VI+Ibero-American+Symposium+on+Software+Engineering&rft.atitle=Optimizing+Lies+in+State+Oriented+Domains+based+on+Genetic+Algorithms&rft.pages=11-18&rft.date=2007&rft.isbn=978-9972-2885-1-7&rft.aulast=Zylberberg&rft.aufirst=A.&rft.au=Calot%2C+E.&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=48" title="Edit section: Further reading">edit</a>]</div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239549316"><div class="refbegin" style=""> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCohen2006" class="citation cs2">Cohen, Paul R. (2006), <a rel="nofollow" class="external text" href="http://www.aaai.org/ojs/index.php/aimagazine/article/download/1849/1747">"'If Not Turing's Test, Then What?"</a>, <a href="/wiki/AI_Magazine" class="mw-redirect" title="AI Magazine">AI Magazine</a>, 26 (4), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20170215021119/http://www.aaai.org/ojs/index.php/aimagazine/article/download/1849/1747">archived</a> from the original on 15 February 2017, retrieved 17 June 2016</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=AI+Magazine&rft.atitle=%27If+Not+Turing%27s+Test%2C+Then+What%3F&rft.volume=26&rft.issue=4&rft.date=2006&rft.aulast=Cohen&rft.aufirst=Paul+R.&rft_id=http%3A%2F%2Fwww.aaai.org%2Fojs%2Findex.php%2Faimagazine%2Farticle%2Fdownload%2F1849%2F1747&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988">.</li> <li><a href="/wiki/Gary_Marcus" title="Gary Marcus">Marcus, Gary</a>, "Am I Human?: Researchers need new ways to distinguish artificial intelligence from the natural kind", <a href="/wiki/Scientific_American" title="Scientific American">Scientific American</a>, vol. 316, no. 3 (March 2017), pp. 58–63. Multiple tests of artificial-intelligence efficacy are needed because, "just as there is no single test of <a href="/wiki/Athletics_(physical_culture)" title="Athletics (physical culture)">athletic</a> prowess, there cannot be one ultimate test of <a href="/wiki/Intelligence" title="Intelligence">intelligence</a>." One such test, a "Construction Challenge", would test perception and physical action—"two important elements of intelligent behavior that were entirely absent from the original Turing test." Another proposal has been to give machines the same standardized tests of science and other disciplines that schoolchildren take. A so far insuperable stumbling block to artificial intelligence is an incapacity for reliable <a href="/wiki/Disambiguation" class="mw-redirect" title="Disambiguation">disambiguation</a>. "[V]irtually every sentence [that people generate] is <a href="/wiki/Ambiguity" title="Ambiguity">ambiguous</a>, often in multiple ways." A prominent example is known as the "pronoun disambiguation problem": a machine has no way of determining to whom or what a <a href="/wiki/Pronoun" title="Pronoun">pronoun</a> in a sentence—such as "he", "she" or "it"—refers.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoor2001" class="citation cs2">Moor, James H. (2001), <a rel="nofollow" class="external text" href="http://portal.acm.org/citation.cfm?id=596908">"The Status and Future of the Turing Test"</a>, Minds and Machines, 11 (1): 77–93, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1011218925467">10.1023/A:1011218925467</a>, <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0924-6495">0924-6495</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:35233851">35233851</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Minds+and+Machines&rft.atitle=The+Status+and+Future+of+the+Turing+Test&rft.volume=11&rft.issue=1&rft.pages=77-93&rft.date=2001&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A35233851%23id-name%3DS2CID&rft.issn=0924-6495&rft_id=info%3Adoi%2F10.1023%2FA%3A1011218925467&rft.aulast=Moor&rft.aufirst=James+H.&rft_id=http%3A%2F%2Fportal.acm.org%2Fcitation.cfm%3Fid%3D596908&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><a href="/wiki/Kevin_Warwick" title="Kevin Warwick">Warwick, Kevin</a> and Shah, Huma (2016), "Turing's Imitation Game: Conversations with the Unknown", Cambridge University Press.</li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2>[<a href="/w/index.php?title=Turing_test&action=edit&section=49" title="Edit section: External links">edit</a>]</div> <style data-mw-deduplicate="TemplateStyles:r1235681985">.mw-parser-output .side-box{margin:4px 0;box-sizing:border-box;border:1px solid #aaa;font-size:88%;line-height:1.25em;background-color:var(--background-color-interactive-subtle,#f8f9fa);display:flow-root}.mw-parser-output .side-box-abovebelow,.mw-parser-output .side-box-text{padding:0.25em 0.9em}.mw-parser-output .side-box-image{padding:2px 0 2px 0.9em;text-align:center}.mw-parser-output .side-box-imageright{padding:2px 0.9em 2px 0;text-align:center}@media(min-width:500px){.mw-parser-output .side-box-flex{display:flex;align-items:center}.mw-parser-output .side-box-text{flex:1;min-width:0}}@media(min-width:720px){.mw-parser-output .side-box{width:238px}.mw-parser-output .side-box-right{clear:right;float:right;margin-left:1em}.mw-parser-output .side-box-left{margin-right:1em}}</style><style data-mw-deduplicate="TemplateStyles:r1237033735">@media print{body.ns-0 .mw-parser-output .sistersitebox{display:none!important}}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}</style><div class="side-box side-box-right plainlinks sistersitebox"><style data-mw-deduplicate="TemplateStyles:r1126788409">.mw-parser-output .plainlist ol,.mw-parser-output .plainlist ul{line-height:inherit;list-style:none;margin:0;padding:0}.mw-parser-output .plainlist ol li,.mw-parser-output .plainlist ul li{margin-bottom:0}</style> <div class="side-box-flex"> <div class="side-box-image"><img alt="" src="//upload.wikimedia.org/wikipedia/en/thumb/4/4a/Commons-logo.svg/30px-Commons-logo.svg.png" decoding="async" width="30" height="40" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/4/4a/Commons-logo.svg/45px-Commons-logo.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/4/4a/Commons-logo.svg/59px-Commons-logo.svg.png 2x" data-file-width="1024" data-file-height="1376" /></div> <div class="side-box-text plainlist">Wikimedia Commons has media related to <a href="https://commons.wikimedia.org/wiki/Category:Turing_test" class="extiw" title="commons:Category:Turing test">Turing test</a>.</div></div> </div> <ul><li><a rel="nofollow" class="external text" href="http://www.turingtestopera.com">The Turing Test – an Opera by Julian Wagstaff</a></li> <li><a rel="nofollow" class="external text" href="http://www.rmcybernetics.com/science/cybernetics/ai_turing_test.htm">The Turing Test</a> – How accurate could the Turing test really be?</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZalta" class="citation encyclopaedia cs1"><a href="/wiki/Edward_N._Zalta" title="Edward N. Zalta">Zalta, Edward N.</a> (ed.). <a rel="nofollow" class="external text" href="https://plato.stanford.edu/entries/turing-test/">"The Turing test"</a>. <a href="/wiki/Stanford_Encyclopedia_of_Philosophy" title="Stanford Encyclopedia of Philosophy">Stanford Encyclopedia of Philosophy</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=The+Turing+test&rft.btitle=Stanford+Encyclopedia+of+Philosophy&rft_id=https%3A%2F%2Fplato.stanford.edu%2Fentries%2Fturing-test%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20050512232753/http://crl.ucsd.edu/~saygin/papers/MMTT.pdf">Turing Test: 50 Years Later</a> reviews a half-century of work on the Turing Test, from the vantage point of 2000.</li> <li><a rel="nofollow" class="external text" href="http://www.longbets.org/1">Bet between Kapor and Kurzweil</a>, including detailed justifications of their respective positions.</li> <li><a rel="nofollow" class="external text" href="http://www.sussex.ac.uk/Users/blayw/tt.html">Why The Turing Test is AI's Biggest Blind Alley</a> by Blay Witby</li> <li><a rel="nofollow" class="external text" href="http://www.jabberwacky.com/">Jabberwacky.com</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20050411014336/http://jabberwacky.com/">Archived</a> 11 April 2005 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a> An AI <a href="/wiki/Chatterbot" class="mw-redirect" title="Chatterbot">chatterbot</a> that learns from and imitates humans</li> <li>New York Times essays on machine intelligence <a rel="nofollow" class="external text" href="https://web.archive.org/web/20040816143151/http://www.rci.rutgers.edu/~cfs/472_html/Intro/NYT_Intro/History/MachineIntelligence2.html">part 1</a> and <a rel="nofollow" class="external text" href="https://web.archive.org/web/20040816143151/http://www.rci.rutgers.edu/~cfs/472_html/Intro/NYT_Intro/History/MachineIntelligence2.html">part 2</a></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation episode cs1"><a rel="nofollow" class="external text" href="http://www.chedd-angier.com/frontiers/season2.html">""The first ever (restricted) Turing test", on season 2, episode 5"</a>. <a href="/wiki/Scientific_American_Frontiers" title="Scientific American Frontiers">Scientific American Frontiers</a>. Chedd-Angier Production Company. 1991–1992. <a href="/wiki/PBS" title="PBS">PBS</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20060101000000/http://www.pbs.org/saf/transcripts/transcript205.htm">Archived</a> from the original on 1 January 2006.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Scientific+American+Frontiers&rft.pub=Chedd-Angier+Production+Company&rft.date=1991%2F1992&rft_id=http%3A%2F%2Fwww.chedd-angier.com%2Ffrontiers%2Fseason2.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ATuring+test" class="Z3988"></li> <li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20091018043414/http://csunplugged.org/turing-test">Computer Science Unplugged teaching activity</a> for the Turing test.</li> <li><a href="https://en.wikinews.org/wiki/Computer_professionals_celebrate_10th_birthday_of_A.L.I.C.E." class="extiw" title="n:Computer professionals celebrate 10th birthday of A.L.I.C.E.">Wiki News:</a> "Talk:Computer professionals celebrate 10th birthday of A.L.I.C.E".</li></ul> <div class="navbox-styles"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><style data-mw-deduplicate="TemplateStyles:r1236075235">.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}</style></div><div role="navigation" class="navbox authority-control" aria-labelledby="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q189223#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q189223#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata" style="font-size:114%;margin:0 4em"><a href="/wiki/Help:Authority_control" title="Help:Authority control">Authority control databases</a> <a href="https://www.wikidata.org/wiki/Q189223#identifiers" title="Edit this at Wikidata"><img alt="Edit this at Wikidata" src="//upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/10px-OOjs_UI_icon_edit-ltr-progressive.svg.png" decoding="async" width="10" height="10" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/15px-OOjs_UI_icon_edit-ltr-progressive.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/20px-OOjs_UI_icon_edit-ltr-progressive.svg.png 2x" data-file-width="20" data-file-height="20" /></a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">International</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><a rel="nofollow" class="external text" href="http://id.worldcat.org/fast/1159286/">FAST</a></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">National</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><a rel="nofollow" class="external text" href="https://d-nb.info/gnd/4770569-3">Germany</a></li><li><a rel="nofollow" class="external text" href="https://id.loc.gov/authorities/sh93008808">United States</a></li><li><a rel="nofollow" class="external text" href="https://catalogue.bnf.fr/ark:/12148/cb16644546h">France</a></li><li><a rel="nofollow" class="external text" href="https://data.bnf.fr/ark:/12148/cb16644546h">BnF data</a></li><li><a rel="nofollow" class="external text" href="http://olduli.nli.org.il/F/?func=find-b&local_base=NLX10&find_code=UID&request=987007549165905171">Israel</a></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Other</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><a rel="nofollow" class="external text" href="https://www.idref.fr/166106372">IdRef</a></li></ul></div></td></tr></tbody></table></div> <div class="navbox-styles"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236075235"></div><div role="navigation" class="navbox" aria-labelledby="Alan_Turing" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239400231"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Alan_Turing" title="Template:Alan Turing"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Alan_Turing" title="Template talk:Alan Turing"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Alan_Turing" title="Special:EditPage/Template:Alan Turing"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Alan_Turing" style="font-size:114%;margin:0 4em"><a href="/wiki/Alan_Turing" title="Alan Turing">Alan Turing</a></div></th></tr><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Turing_completeness" title="Turing completeness">Turing completeness</a></li> <li><a href="/wiki/Turing_degree" title="Turing degree">Turing degree</a></li> <li><a href="/wiki/Turing_machine" title="Turing machine">Turing machine</a></li> <li><a href="/wiki/Turing_pattern" title="Turing pattern">Turing pattern</a></li> <li><a href="/wiki/Turing%27s_proof" title="Turing's proof">Turing's proof</a></li> <li><a href="/wiki/Turing_reduction" title="Turing reduction">Turing reduction</a></li> <li><a class="mw-selflink selflink">Turing test</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Publications</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li>"<a href="/wiki/On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem" class="mw-redirect" title="On Computable Numbers, with an Application to the Entscheidungsproblem">On Computable Numbers</a>" (1936)</li> <li>"<a href="/wiki/Systems_of_Logic_Based_on_Ordinals" title="Systems of Logic Based on Ordinals">Systems of Logic Based on Ordinals</a>" (1939)</li> <li>"<a href="/wiki/Unorganized_machine" title="Unorganized machine">Intelligent Machinery</a>" (1948)</li> <li>"<a href="/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence">Computing Machinery and Intelligence</a>" (1950)</li> <li>"<a href="/wiki/The_Chemical_Basis_of_Morphogenesis" title="The Chemical Basis of Morphogenesis">The Chemical Basis of Morphogenesis</a>" (1952)</li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Related</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Legacy_of_Alan_Turing" title="Legacy of Alan Turing">Legacy of Alan Turing</a> <ul><li><a href="/wiki/List_of_things_named_after_Alan_Turing" title="List of things named after Alan Turing">namesakes</a></li></ul></li></ul> </div></td></tr></tbody></table></div>    </div><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://en.wikipedia.org/w/index.php?title=Turing_test&oldid=1257901311">https://en.wikipedia.org/w/index.php?title=Turing_test&oldid=1257901311</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Help:Category" title="Help:Category">Categories</a>: <ul><li><a href="/wiki/Category:1950_in_computing" title="Category:1950 in computing">1950 in computing</a></li><li><a href="/wiki/Category:Alan_Turing" title="Category:Alan Turing">Alan Turing</a></li><li><a href="/wiki/Category:Computer-related_introductions_in_1950" title="Category:Computer-related introductions in 1950">Computer-related introductions in 1950</a></li><li><a href="/wiki/Category:History_of_artificial_intelligence" title="Category:History of artificial intelligence">History of artificial intelligence</a></li><li><a href="/wiki/Category:Human%E2%80%93computer_interaction" title="Category:Human–computer interaction">Human–computer interaction</a></li><li><a href="/wiki/Category:Philosophy_of_artificial_intelligence" title="Category:Philosophy of artificial intelligence">Philosophy of artificial intelligence</a></li><li><a href="/wiki/Category:Turing_tests" title="Category:Turing tests">Turing tests</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">Hidden categories: <ul><li><a href="/wiki/Category:Webarchive_template_wayback_links" title="Category:Webarchive template wayback links">Webarchive template wayback links</a></li><li><a href="/wiki/Category:Wikipedia_articles_needing_clarification_from_January_2021" title="Category:Wikipedia articles needing clarification from January 2021">Wikipedia articles needing clarification from January 2021</a></li><li><a href="/wiki/Category:Wikipedia_articles_needing_page_number_citations_from_May_2011" title="Category:Wikipedia articles needing page number citations from May 2011">Wikipedia articles needing page number citations from May 2011</a></li><li><a href="/wiki/Category:All_articles_with_dead_external_links" title="Category:All articles with dead external links">All articles with dead external links</a></li><li><a href="/wiki/Category:Articles_with_dead_external_links_from_September_2023" title="Category:Articles with dead external links from September 2023">Articles with dead external links from September 2023</a></li><li><a href="/wiki/Category:Articles_with_permanently_dead_external_links" title="Category:Articles with permanently dead external links">Articles with permanently dead external links</a></li><li><a href="/wiki/Category:Articles_with_dead_external_links_from_July_2018" title="Category:Articles with dead external links from July 2018">Articles with dead external links from July 2018</a></li><li><a href="/wiki/Category:Articles_with_short_description" title="Category:Articles with short description">Articles with short description</a></li><li><a href="/wiki/Category:Short_description_is_different_from_Wikidata" title="Category:Short description is different from Wikidata">Short description is different from Wikidata</a></li><li><a href="/wiki/Category:Use_British_English_from_February_2024" title="Category:Use British English from February 2024">Use British English from February 2024</a></li><li><a href="/wiki/Category:Use_dmy_dates_from_June_2014" title="Category:Use dmy dates from June 2014">Use dmy dates from June 2014</a></li><li><a href="/wiki/Category:All_articles_with_unsourced_statements" title="Category:All articles with unsourced statements">All articles with unsourced statements</a></li><li><a href="/wiki/Category:Articles_with_unsourced_statements_from_November_2024" title="Category:Articles with unsourced statements from November 2024">Articles with unsourced statements from November 2024</a></li><li><a href="/wiki/Category:Commons_category_link_from_Wikidata" title="Category:Commons category link from Wikidata">Commons category link from Wikidata</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 17 November 2024, at 04:50 (UTC).</li> <li id="footer-info-copyright">Text is available under the <a href="/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License" title="Wikipedia:Text of the Creative Commons Attribution-ShareAlike 4.0 International License">Creative Commons Attribution-ShareAlike 4.0 License</a>; additional terms may apply. By using this site, you agree to the <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use" class="extiw" title="foundation:Special:MyLanguage/Policy:Terms of Use">Terms of Use</a> and <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy" class="extiw" title="foundation:Special:MyLanguage/Policy:Privacy policy">Privacy Policy</a>. Wikipedia® is a registered trademark of the <a rel="nofollow" class="external text" href="https://wikimediafoundation.org/">Wikimedia Foundation, Inc.</a>, a non-profit organization.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:About">About Wikipedia</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:General_disclaimer">Disclaimers</a></li> <li id="footer-places-contact"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us">Contact Wikipedia</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Code of Conduct</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Developers</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/en.wikipedia.org">Statistics</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie statement</a></li> <li id="footer-places-mobileview"><a href="//en.m.wikipedia.org/w/index.php?title=Turing_test&mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-688fc9465-cwz5g","wgBackendResponseTime":218,"wgPageParseReport":{"limitreport":{"cputime":"1.782","walltime":"2.172","ppvisitednodes":{"value":13149,"limit":1000000},"postexpandincludesize":{"value":292996,"limit":2097152},"templateargumentsize":{"value":11870,"limit":2097152},"expansiondepth":{"value":19,"limit":100},"expensivefunctioncount":{"value":25,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":425721,"limit":5000000},"entityaccesscount":{"value":1,"limit":400},"timingprofile":["100.00% 1893.663 1 -total"," 29.62% 560.850 1 Template:Reflist"," 20.18% 382.051 73 Template:Citation"," 19.27% 364.943 74 Template:Sfn"," 8.95% 169.465 18 Template:Cite_web"," 6.09% 115.415 4 Template:Fix"," 5.90% 111.730 1 Template:Artificial_intelligence"," 5.80% 109.755 1 Template:Short_description"," 5.78% 109.390 1 Template:Sidebar_with_collapsible_lists"," 5.29% 100.135 1 Template:Page_needed"]},"scribunto":{"limitreport-timeusage":{"value":"1.166","limit":"10.000"},"limitreport-memusage":{"value":9133052,"limit":52428800},"limitreport-logs":"anchor_id_list = table#1 {\n [\"CITEREFAlex_Pasternack2011\"] = 1,\n [\"CITEREFAmini2020\"] = 1,\n [\"CITEREFAyer2001\"] = 1,\n [\"CITEREFBiever2023\"] = 2,\n [\"CITEREFBion1979\"] = 1,\n [\"CITEREFBoden2006\"] = 1,\n [\"CITEREFBrynjolfsson2022\"] = 1,\n [\"CITEREFCacm_Staff2017\"] = 1,\n [\"CITEREFCohen2006\"] = 1,\n [\"CITEREFColbyHilfWeberKraemer1972\"] = 1,\n [\"CITEREFCopeland2003\"] = 1,\n [\"CITEREFCrevier1993\"] = 1,\n [\"CITEREFD_L_DoweA_R_Hajek1997\"] = 2,\n [\"CITEREFDan_Williams2022\"] = 1,\n [\"CITEREFDanziger2022\"] = 1,\n [\"CITEREFDescartes1996\"] = 1,\n [\"CITEREFDiderot2007\"] = 1,\n [\"CITEREFDreyfus1979\"] = 1,\n [\"CITEREFEvansRobertson1968\"] = 1,\n [\"CITEREFFeigenbaum2003\"] = 1,\n [\"CITEREFFrench\"] = 1,\n [\"CITEREFFrench1990\"] = 1,\n [\"CITEREFGenova1994\"] = 1,\n [\"CITEREFGent2014\"] = 1,\n [\"CITEREFGhosemajumder\"] = 1,\n [\"CITEREFGonçalves2023a\"] = 1,\n [\"CITEREFGonçalves2023b\"] = 1,\n [\"CITEREFHarnad2004\"] = 1,\n [\"CITEREFHaugeland1985\"] = 1,\n [\"CITEREFHauser1997\"] = 1,\n [\"CITEREFHayesFord1995\"] = 1,\n [\"CITEREFHeil1998\"] = 1,\n [\"CITEREFHernandez-OralloDowe2010\"] = 1,\n [\"CITEREFHinshelwood2001\"] = 1,\n [\"CITEREFHoy2018\"] = 1,\n [\"CITEREFJeremy_Kahn2022\"] = 1,\n [\"CITEREFJose_Hernandez-Orallo2000\"] = 2,\n [\"CITEREFKevin_WarwickHuma_Shah2014\"] = 1,\n [\"CITEREFKey2023\"] = 1,\n [\"CITEREFKurzweil1990\"] = 1,\n [\"CITEREFKurzweil2005\"] = 1,\n [\"CITEREFLoebner1994\"] = 1,\n [\"CITEREFMalikMori\"] = 1,\n [\"CITEREFMarcus2014\"] = 1,\n [\"CITEREFMasnick2014\"] = 1,\n [\"CITEREFMcCarthy1996\"] = 1,\n [\"CITEREFMcKinstry1997\"] = 1,\n [\"CITEREFMeiXieYuanJackson2024\"] = 1,\n [\"CITEREFMoor2001\"] = 1,\n [\"CITEREFMoor2003\"] = 1,\n [\"CITEREFNitasha_Tiku2022\"] = 1,\n [\"CITEREFPachal\"] = 1,\n [\"CITEREFParsonsDixon2016\"] = 1,\n [\"CITEREFPenrose1989\"] = 1,\n [\"CITEREFPress\"] = 1,\n [\"CITEREFProudfoot2013\"] = 1,\n [\"CITEREFRehman2009\"] = 1,\n [\"CITEREFRussellNorvig2010\"] = 1,\n [\"CITEREFSaygin2000\"] = 1,\n [\"CITEREFSayginCicekli2002\"] = 1,\n [\"CITEREFSayginRobertsBeber2008\"] = 1,\n [\"CITEREFSchwaninger2022\"] = 1,\n [\"CITEREFScott\"] = 1,\n [\"CITEREFSearle1980\"] = 1,\n [\"CITEREFShah2011\"] = 1,\n [\"CITEREFShahWarwick2009a\"] = 1,\n [\"CITEREFShahWarwick2010a\"] = 1,\n [\"CITEREFShahWarwick2010j\"] = 1,\n [\"CITEREFShane_LeggMarcus_Hutter2007\"] = 1,\n [\"CITEREFShapiro1992\"] = 1,\n [\"CITEREFShieber1994\"] = 1,\n [\"CITEREFSmith,_G._W.2015\"] = 1,\n [\"CITEREFSterrett2000\"] = 1,\n [\"CITEREFSundman2003\"] = 1,\n [\"CITEREFSvilpis2008\"] = 1,\n [\"CITEREFSwift1726\"] = 1,\n [\"CITEREFSwirski2000\"] = 1,\n [\"CITEREFThomas1995\"] = 1,\n [\"CITEREFThompson2005\"] = 1,\n [\"CITEREFThornley1997\"] = 1,\n [\"CITEREFTraiger2000\"] = 1,\n [\"CITEREFTung\"] = 1,\n [\"CITEREFTuring1948\"] = 1,\n [\"CITEREFTuring1952\"] = 1,\n [\"CITEREFUrban,_Tim2015\"] = 1,\n [\"CITEREFWansbrough2021\"] = 1,\n [\"CITEREFWarwickShah2015\"] = 1,\n [\"CITEREFWarwickShah2017\"] = 1,\n [\"CITEREFWeizenbaum1966\"] = 1,\n [\"CITEREFWhitby1996\"] = 1,\n [\"CITEREFWilliams2007\"] = 1,\n [\"CITEREFWithers2007\"] = 1,\n [\"CITEREFZylberbergCalot2007\"] = 1,\n}\ntemplate_list = table#1 {\n [\"!\"] = 6,\n [\"' \\\"\"] = 4,\n [\"Alan Turing\"] = 1,\n [\"Artificial intelligence\"] = 1,\n [\"Authority control\"] = 1,\n [\"Blockquote\"] = 3,\n [\"Citation\"] = 71,\n [\"Cite SEP\"] = 1,\n [\"Cite book\"] = 3,\n [\"Cite journal\"] = 10,\n [\"Cite magazine\"] = 2,\n [\"Cite news\"] = 5,\n [\"Cite web\"] = 18,\n [\"Clarify\"] = 1,\n [\"Cn\"] = 1,\n [\"Commons category\"] = 1,\n [\"DEFAULTSORT:Turing Test\"] = 1,\n [\"Dead link\"] = 2,\n [\"Div col\"] = 1,\n [\"Div col end\"] = 1,\n [\"Harv\"] = 4,\n [\"Harvid\"] = 3,\n [\"Harvnb\"] = 13,\n [\"Harvtxt\"] = 5,\n [\"Hatnote group\"] = 1,\n [\"ISBN\"] = 2,\n [\"Main\"] = 13,\n [\"McCorduck 2004\"] = 1,\n [\"Other uses\"] = 1,\n [\"Page needed\"] = 1,\n [\"Redirect\"] = 1,\n [\"Refbegin\"] = 2,\n [\"Refend\"] = 2,\n [\"Reflist\"] = 1,\n [\"Russell Norvig 2003\"] = 1,\n [\"Scientific American Frontiers\"] = 2,\n [\"See also\"] = 1,\n [\"Sfn\"] = 74,\n [\"Short description\"] = 1,\n [\"Turing 1950\"] = 1,\n [\"Use British English\"] = 1,\n [\"Use dmy dates\"] = 1,\n [\"Webarchive\"] = 4,\n}\narticle_whitelist = table#1 {\n}\n","limitreport-profile":[["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::callParserFunction","340","27.0"],["?","160","12.7"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::match","120","9.5"],["recursiveClone \u003CmwInit.lua:45\u003E","100","7.9"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::getAllExpandedArguments","80","6.3"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::find","60","4.8"],["rawset","60","4.8"],["dataWrapper \u003Cmw.lua:672\u003E","60","4.8"],["format","40","3.2"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::gsub","40","3.2"],["[others]","200","15.9"]]},"cachereport":{"origin":"mw-web.codfw.main-6b7f745dd4-bgcv7","timestamp":"20241125133623","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"Turing test","url":"https:\/\/en.wikipedia.org\/wiki\/Turing_test","sameAs":"http:\/\/www.wikidata.org\/entity\/Q189223","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q189223","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2001-08-26T20:08:30Z","dateModified":"2024-11-17T04:50:28Z","image":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/5\/55\/Turing_test_diagram.png","headline":"test of a machine's ability to exhibit intelligent behavior equivalent to that of a human"}</script> </body> </html>