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>Computing Machinery and Intelligence - 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":"2df4f847-32c0-4a42-8daf-9c091b9212fc","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Computing_Machinery_and_Intelligence","wgTitle":"Computing Machinery and Intelligence","wgCurRevisionId":1255984972,"wgRevisionId":1255984972,"wgArticleId":404048,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["All articles with dead external links","Articles with dead external links from December 2023","Articles with permanently dead external links","Articles with short description","Short description is different from Wikidata","Use dmy dates from April 2018","Use British English from April 2018","Pages with broken anchors","1950 documents","History of artificial intelligence","Philosophy of artificial intelligence", "Artificial intelligence papers","Alan Turing","Cognitive science literature","Works originally published in Mind (journal)"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"Computing_Machinery_and_Intelligence","wgRelevantArticleId":404048,"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":30000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition": "interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q772056","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.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 name="viewport" content="width=1120"> <meta property="og:title" content="Computing Machinery and Intelligence - 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/Computing_Machinery_and_Intelligence"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=Computing_Machinery_and_Intelligence&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/Computing_Machinery_and_Intelligence"> <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-Computing_Machinery_and_Intelligence rootpage-Computing_Machinery_and_Intelligence 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" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">Main menu</span> </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"><span>Main page</span></a></li><li id="n-contents" class="mw-list-item"><a href="/wiki/Wikipedia:Contents" title="Guides to browsing Wikipedia"><span>Contents</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Current_events" title="Articles related to current events"><span>Current events</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Visit a randomly selected article [x]" accesskey="x"><span>Random article</span></a></li><li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:About" title="Learn about Wikipedia and how it works"><span>About Wikipedia</span></a></li><li id="n-contactpage" class="mw-list-item"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us" title="How to contact Wikipedia"><span>Contact us</span></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"><span>Help</span></a></li><li id="n-introduction" class="mw-list-item"><a href="/wiki/Help:Introduction" title="Learn how to edit Wikipedia"><span>Learn to edit</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:Community_portal" title="The hub for editors"><span>Community portal</span></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"><span>Recent changes</span></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"><span>Upload file</span></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"> <span class="mw-logo-container skin-invert"> <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;"> </span> </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"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>Search</span> </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" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </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" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">Appearance</span> </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=""><span>Donate</span></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=Computing+Machinery+and+Intelligence" title="You are encouraged to create an account and log in; however, it is not mandatory" class=""><span>Create account</span></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=Computing+Machinery+and+Intelligence" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o" class=""><span>Log in</span></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" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">Personal tools</span> </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"><span>Donate</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=Computing+Machinery+and+Intelligence" title="You are encouraged to create an account and log in; however, it is not mandatory"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>Create account</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=Computing+Machinery+and+Intelligence" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>Log in</span></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"><span>learn more</span></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"><span>Contributions</span></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"><span>Talk</span></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-Turing's_test" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Turing's_test"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>Turing's test</span> </div> </a> <ul id="toc-Turing's_test-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Digital_machines" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Digital_machines"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Digital machines</span> </div> </a> <ul id="toc-Digital_machines-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Nine_common_objections" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Nine_common_objections"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>Nine common objections</span> </div> </a> <ul id="toc-Nine_common_objections-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Learning_machines" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Learning_machines"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>Learning machines</span> </div> </a> <ul id="toc-Learning_machines-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Notes" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Notes"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>Notes</span> </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 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#References"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>References</span> </div> </a> <ul id="toc-References-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-External_links" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#External_links"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>External links</span> </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" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">Toggle the table of contents</span> </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"><span class="mw-page-title-main">Computing Machinery and Intelligence</span></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 13 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-13" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">13 languages</span> </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/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence – Afrikaans" lang="af" hreflang="af" data-title="Computing Machinery and Intelligence" data-language-autonym="Afrikaans" data-language-local-name="Afrikaans" class="interlanguage-link-target"><span>Afrikaans</span></a></li><li class="interlanguage-link interwiki-bn mw-list-item"><a href="https://bn.wikipedia.org/wiki/%E0%A6%95%E0%A6%AE%E0%A7%8D%E0%A6%AA%E0%A6%BF%E0%A6%89%E0%A6%9F%E0%A6%BF%E0%A6%82_%E0%A6%AE%E0%A7%87%E0%A6%B6%E0%A6%BF%E0%A6%A8%E0%A6%BE%E0%A6%B0%E0%A6%BF_%E0%A6%85%E0%A7%8D%E0%A6%AF%E0%A6%BE%E0%A6%A8%E0%A7%8D%E0%A6%A1_%E0%A6%87%E0%A6%A8%E0%A6%9F%E0%A7%87%E0%A6%B2%E0%A6%BF%E0%A6%9C%E0%A7%87%E0%A6%A8%E0%A7%8D%E0%A6%B8" title="কম্পিউটিং মেশিনারি অ্যান্ড ইনটেলিজেন্স – Bangla" lang="bn" hreflang="bn" data-title="কম্পিউটিং মেশিনারি অ্যান্ড ইনটেলিজেন্স" data-language-autonym="বাংলা" data-language-local-name="Bangla" class="interlanguage-link-target"><span>বাংলা</span></a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wikipedia.org/wiki/Computing_machinery_and_intelligence" title="Computing machinery and intelligence – Spanish" lang="es" hreflang="es" data-title="Computing machinery and intelligence" data-language-autonym="Español" data-language-local-name="Spanish" class="interlanguage-link-target"><span>Español</span></a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D9%87%D9%88%D8%B4_%D9%88_%D9%85%D8%A7%D8%B4%DB%8C%D9%86%E2%80%8C%D9%87%D8%A7%DB%8C_%D9%85%D8%AD%D8%A7%D8%B3%D8%A8%D8%A7%D8%AA%DB%8C" title="هوش و ماشین‌های محاسباتی – Persian" lang="fa" hreflang="fa" data-title="هوش و ماشین‌های محاسباتی" data-language-autonym="فارسی" data-language-local-name="Persian" class="interlanguage-link-target"><span>فارسی</span></a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence – French" lang="fr" hreflang="fr" data-title="Computing Machinery and Intelligence" data-language-autonym="Français" data-language-local-name="French" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-zu mw-list-item"><a href="https://zu.wikipedia.org/wiki/Inguxa_yokuCikiza_nobuHlakani" title="Inguxa yokuCikiza nobuHlakani – Zulu" lang="zu" hreflang="zu" data-title="Inguxa yokuCikiza nobuHlakani" data-language-autonym="IsiZulu" data-language-local-name="Zulu" class="interlanguage-link-target"><span>IsiZulu</span></a></li><li class="interlanguage-link interwiki-la badge-Q17437796 badge-featuredarticle mw-list-item" title="featured article badge"><a href="https://la.wikipedia.org/wiki/Computing_machinery_and_intelligence" title="Computing machinery and intelligence – Latin" lang="la" hreflang="la" data-title="Computing machinery and intelligence" data-language-autonym="Latina" data-language-local-name="Latin" class="interlanguage-link-target"><span>Latina</span></a></li><li class="interlanguage-link interwiki-no mw-list-item"><a href="https://no.wikipedia.org/wiki/Computing_machinery_and_intelligence" title="Computing machinery and intelligence – Norwegian Bokmål" lang="nb" hreflang="nb" data-title="Computing machinery and intelligence" data-language-autonym="Norsk bokmål" data-language-local-name="Norwegian Bokmål" class="interlanguage-link-target"><span>Norsk bokmål</span></a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/Computing_machinery_and_intelligence" title="Computing machinery and intelligence – Portuguese" lang="pt" hreflang="pt" data-title="Computing machinery and intelligence" data-language-autonym="Português" data-language-local-name="Portuguese" class="interlanguage-link-target"><span>Português</span></a></li><li class="interlanguage-link interwiki-ru mw-list-item"><a href="https://ru.wikipedia.org/wiki/%D0%92%D1%8B%D1%87%D0%B8%D1%81%D0%BB%D0%B8%D1%82%D0%B5%D0%BB%D1%8C%D0%BD%D1%8B%D0%B5_%D0%BC%D0%B0%D1%88%D0%B8%D0%BD%D1%8B_%D0%B8_%D1%80%D0%B0%D0%B7%D1%83%D0%BC" title="Вычислительные машины и разум – Russian" lang="ru" hreflang="ru" data-title="Вычислительные машины и разум" data-language-autonym="Русский" data-language-local-name="Russian" class="interlanguage-link-target"><span>Русский</span></a></li><li class="interlanguage-link interwiki-sr mw-list-item"><a href="https://sr.wikipedia.org/wiki/Ra%C4%8Dunarska_ma%C5%A1ina_i_inteligencija" title="Računarska mašina i inteligencija – Serbian" lang="sr" hreflang="sr" data-title="Računarska mašina i inteligencija" data-language-autonym="Српски / srpski" data-language-local-name="Serbian" class="interlanguage-link-target"><span>Српски / srpski</span></a></li><li class="interlanguage-link interwiki-fi mw-list-item"><a href="https://fi.wikipedia.org/wiki/Computing_machinery_and_intelligence" title="Computing machinery and intelligence – Finnish" lang="fi" hreflang="fi" data-title="Computing machinery and intelligence" data-language-autonym="Suomi" data-language-local-name="Finnish" class="interlanguage-link-target"><span>Suomi</span></a></li><li class="interlanguage-link interwiki-sv mw-list-item"><a href="https://sv.wikipedia.org/wiki/Computing_Machinery_and_Intelligence" title="Computing Machinery and Intelligence – Swedish" lang="sv" hreflang="sv" data-title="Computing Machinery and Intelligence" data-language-autonym="Svenska" data-language-local-name="Swedish" class="interlanguage-link-target"><span>Svenska</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q772056#sitelinks-wikipedia" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></span></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/Computing_Machinery_and_Intelligence" title="View the content page [c]" accesskey="c"><span>Article</span></a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:Computing_Machinery_and_Intelligence" rel="discussion" title="Discuss improvements to the content page [t]" accesskey="t"><span>Talk</span></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" ><span class="vector-dropdown-label-text">English</span> </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/Computing_Machinery_and_Intelligence"><span>Read</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=history" title="Past revisions of this page [h]" accesskey="h"><span>View history</span></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" ><span class="vector-dropdown-label-text">Tools</span> </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/Computing_Machinery_and_Intelligence"><span>Read</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=history"><span>View history</span></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/Computing_Machinery_and_Intelligence" title="List of all English Wikipedia pages containing links to this page [j]" accesskey="j"><span>What links here</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Computing_Machinery_and_Intelligence" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k"><span>Related changes</span></a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_Upload_Wizard" title="Upload files [u]" accesskey="u"><span>Upload file</span></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"><span>Special pages</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&oldid=1255984972" title="Permanent link to this revision of this page"><span>Permanent link</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=info" title="More information about this page"><span>Page information</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:CiteThisPage&page=Computing_Machinery_and_Intelligence&id=1255984972&wpFormIdentifier=titleform" title="Information on how to cite this page"><span>Cite this page</span></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%2FComputing_Machinery_and_Intelligence"><span>Get shortened URL</span></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%2FComputing_Machinery_and_Intelligence"><span>Download QR code</span></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=Computing_Machinery_and_Intelligence&action=show-download-screen" title="Download this page as a PDF file"><span>Download as PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&printable=yes" title="Printable version of this page [p]" accesskey="p"><span>Printable version</span></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 id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q772056" title="Structured data on this page hosted by Wikidata [g]" accesskey="g"><span>Wikidata item</span></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">1950 scientific article by Alan Turing</div> <p> "<b>Computing Machinery and Intelligence</b>" is a seminal paper written by <a href="/wiki/Alan_Turing" title="Alan Turing">Alan Turing</a> on the topic of <a href="/wiki/Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a>. The paper, published in 1950 in <i><a href="/wiki/Mind_(journal)" title="Mind (journal)">Mind</a></i>, was the first to introduce his concept of what is now known as the <a href="/wiki/Turing_test" title="Turing test">Turing test</a> to the general public. </p><p>Turing's paper considers the question "Can machines think?" Turing says that since the words "think" and "machine" cannot be clearly defined, we should "replace the question by another, which is closely related to it and is expressed in relatively unambiguous words."<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> To do this, he must first find a simple and unambiguous idea to replace the word "think", second he must explain exactly which "machines" he is considering, and finally, armed with these tools, he formulates a new question, related to the first, that he believes he can answer in the affirmative. </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Turing's_test"><span id="Turing.27s_test"></span>Turing's test</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=1" title="Edit section: Turing's test"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Turing_Test_version_3.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/e/e4/Turing_Test_version_3.png/220px-Turing_Test_version_3.png" decoding="async" width="220" height="282" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/e/e4/Turing_Test_version_3.png 1.5x" data-file-width="250" data-file-height="320" /></a><figcaption>The "standard interpretation" of the Turing Test, in which the interrogator is tasked with trying to determine which player is a computer and which is a human</figcaption></figure> <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">Main article: <a href="/wiki/Turing_test" title="Turing test">Turing test</a></div> <p>Rather than trying to determine if a machine is thinking, Turing suggests we should ask if the machine can win a game, called the "<a href="/wiki/Turing_test#Imitation_game" title="Turing test">Imitation Game</a><sup class="noprint Inline-Template" style="white-space:nowrap;">[<i><a href="/wiki/MOS:BROKENSECTIONLINKS" class="mw-redirect" title="MOS:BROKENSECTIONLINKS"><span title="The anchor (Imitation game) has been deleted. (2024-11-07)">broken anchor</span></a></i>]</sup>". The original Imitation game, that Turing described, is 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) can be of either sex. In the Imitation Game, player C is unable to see either player A or player B (and knows them only as X and Y), and can communicate with them only through written notes or any other form that does not give away any details about their gender. 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.<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> </p><p>Turing proposes a variation of this game that involves the computer: <span style="padding-right:.15em;">'</span>"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?<span style="padding-right:.15em;">"</span>'.<sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> So the modified game becomes one that involves three participants in isolated rooms: a computer (which is being tested), a human, and a (human) judge. The human judge can converse with both the human and the computer by typing into a terminal. Both the computer and human try to convince the judge that they are the human. If the judge cannot consistently tell which is which, then the computer wins the game.<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> </p><p>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.<sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> 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. Turing, in particular, had been running the notion of machine intelligence since at least 1941 and one of the earliest-known mentions of "computer intelligence" was made by him in 1947.<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> </p><p>As <a href="/wiki/Stevan_Harnad" title="Stevan Harnad">Stevan Harnad</a> notes,<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> the question has become "Can machines do what we (as thinking entities) can do?" In other words, Turing is no longer asking whether a machine can "think"; he is asking whether a machine can <i>act</i> indistinguishably<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> from the way a thinker acts. This question avoids the difficult philosophical problem of pre-defining the verb "to think" and focuses instead on the performance capacities that being able to think makes possible, and how a causal system can generate them. </p><p>Since Turing introduced his test, it has been both highly influential and widely criticised, 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>.<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup> Some of its criticisms, such as <a href="/wiki/John_Searle" title="John Searle">John Searle</a>'s <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a>, are themselves controversial.<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-fortune_lambda_12-0" class="reference"><a href="#cite_note-fortune_lambda-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup> Some have taken Turing's question to have been "Can a computer, communicating over a teleprinter, fool a person into believing it is human?"<sup id="cite_ref-NMR_13-0" class="reference"><a href="#cite_note-NMR-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup> but it seems clear that Turing was not talking about fooling people but about generating human cognitive capacity.<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Digital_machines">Digital machines</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=2" title="Edit section: Digital machines"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></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/Turing_machine" title="Turing machine">Turing machine</a> and <a href="/wiki/Church%E2%80%93Turing_thesis" title="Church–Turing thesis">Church–Turing thesis</a></div> <p>Turing also notes that we need to determine which "machines" we wish to consider. He points out that a human <a href="/wiki/Cloning" title="Cloning">clone</a>, while man-made, would not provide a very interesting example. Turing suggested that we should focus on the capabilities of digital machinery—machines which manipulate the binary digits of 1 and 0, rewriting them into memory using simple rules. He gave two reasons. </p><p>First, there is no reason to speculate whether or not they can exist. They already did in 1950. </p><p>Second, digital machinery is "universal". Turing's research into the <a href="/wiki/Theory_of_computation" title="Theory of computation">foundations of computation</a> had proved that a digital computer can, in theory, simulate the behaviour of any other digital machine, given enough memory and time. (This is the essential insight of the <a href="/wiki/Church%E2%80%93Turing_thesis" title="Church–Turing thesis">Church–Turing thesis</a> and the <a href="/wiki/Universal_Turing_machine" title="Universal Turing machine">universal Turing machine</a>.) Therefore, if <i>any</i> digital machine can "act like it is thinking", then <i>every</i> sufficiently powerful digital machine can. Turing writes, "all digital computers are in a sense equivalent."<sup id="cite_ref-P442_15-0" class="reference"><a href="#cite_note-P442-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup> </p><p>This allows the original question to be made even more specific. Turing now restates the original question as "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?"<sup id="cite_ref-P442_15-1" class="reference"><a href="#cite_note-P442-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup> </p><p>Hence, Turing states that the focus is not on "whether all digital computers would do well in the game nor whether the computers that are presently available would do well, but whether there are imaginable computers which would do well".<sup id="cite_ref-P436_16-0" class="reference"><a href="#cite_note-P436-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup> What is more important is to consider the advancements possible in the state of our machines today regardless of whether we have the available resource to create one or not. </p> <div class="mw-heading mw-heading2"><h2 id="Nine_common_objections">Nine common objections</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=3" title="Edit section: Nine common objections"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></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/Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">Philosophy of artificial intelligence</a></div> <p>Having clarified the question, Turing turned to answering it: he considered the following nine common objections, which include all the major arguments against artificial intelligence raised in the years since his paper was first published.<sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup> </p> <ol><li><i><a href="/wiki/Religious" class="mw-redirect" title="Religious">Religious</a> Objection</i>: This states that thinking is a function of man's <a href="/wiki/Immortality" title="Immortality">immortal</a> <a href="/wiki/Soul" title="Soul">soul</a>; therefore, a machine cannot think. "In attempting to construct such machines," wrote Turing, "we should not be irreverently usurping His power of creating souls, any more than we are in the procreation of children: rather we are, in either case, instruments of His will providing mansions for the souls that He creates."</li> <li><i> 'Heads in the Sand' Objection</i>: "The consequences of machines thinking would be too dreadful. Let us hope and believe that they cannot do so." This thinking is popular among intellectual people, as they believe superiority derives from higher intelligence and <a href="/wiki/Existential_risk_from_artificial_general_intelligence" class="mw-redirect" title="Existential risk from artificial general intelligence">the possibility of being overtaken is a threat</a> (as machines have efficient memory capacities and processing speed, machines exceeding the learning and knowledge capabilities are highly probable). This objection is a fallacious <a href="/wiki/Appeal_to_consequences" title="Appeal to consequences">appeal to consequences</a>, confusing what should not be with what can or cannot be (Wardrip-Fruin, 56).</li> <li><i>The <a href="/wiki/Mathematics" title="Mathematics">Mathematical</a> Objection</i>: This objection uses mathematical theorems, such as <a href="/wiki/G%C3%B6del%27s_incompleteness_theorem" class="mw-redirect" title="Gödel's incompleteness theorem">Gödel's incompleteness theorem</a>, to show that there are limits to what questions a computer system based on <a href="/wiki/Logic" title="Logic">logic</a> can answer. Turing suggests that humans are too often wrong themselves and pleased at the fallibility of a machine. (This argument would be made again by philosopher <a href="/wiki/John_Lucas_(philosopher)" title="John Lucas (philosopher)">John Lucas</a> in 1961 and <a href="/wiki/Physicist" title="Physicist">physicist</a> <a href="/wiki/Roger_Penrose" title="Roger Penrose">Roger Penrose</a> in 1989.)<sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">[</span>18<span class="cite-bracket">]</span></a></sup></li> <li><i>Argument From <a href="/wiki/Consciousness" title="Consciousness">Consciousness</a></i>: This argument, suggested by Professor <a href="/wiki/Geoffrey_Jefferson" title="Geoffrey Jefferson">Geoffrey Jefferson</a> in his 1949 <a href="/wiki/Lister_Medal" title="Lister Medal">Lister Oration</a> (acceptance speech for his 1948 award of Lister Medal<sup id="cite_ref-19" class="reference"><a href="#cite_note-19"><span class="cite-bracket">[</span>19<span class="cite-bracket">]</span></a></sup>) states that "not until a machine can write a sonnet or compose a concerto because of thoughts and emotions felt, and not by the chance fall of symbols, could we agree that machine equals brain."<sup id="cite_ref-20" class="reference"><a href="#cite_note-20"><span class="cite-bracket">[</span>20<span class="cite-bracket">]</span></a></sup> Turing replies by saying that we have no way of knowing that any individual other than ourselves experiences emotions, and that therefore we should accept the test. He adds, "I do not wish to give the impression that I think there is no mystery about consciousness ... [b]ut I do not think these mysteries necessarily need to be solved before we can answer the question [of whether machines can think]." (This argument, that a computer can't have <i>conscious experiences</i> or <i>understanding</i>, would be made in 1980 by philosopher <a href="/wiki/John_Searle" title="John Searle">John Searle</a> in his <a href="/wiki/Chinese_room" title="Chinese room">Chinese room</a> argument. Turing's reply is now known as the "<a href="/wiki/Problem_of_other_minds" title="Problem of other minds">other minds</a> reply". See also <a href="/wiki/Philosophy_of_artificial_intelligence#Can_a_machine_have_a_mind,_consciousness_and_mental_states?" title="Philosophy of artificial intelligence">Can a machine have a mind?</a> in the <a href="/wiki/Philosophy_of_AI" class="mw-redirect" title="Philosophy of AI">philosophy of AI</a>.)<sup id="cite_ref-21" class="reference"><a href="#cite_note-21"><span class="cite-bracket">[</span>21<span class="cite-bracket">]</span></a></sup></li> <li><i>Arguments from various disabilities</i>. These arguments all have the form "a computer will never do <i>X</i>". Turing offers a selection:<blockquote><p>Be kind, resourceful, beautiful, friendly, have initiative, have a sense of humour, tell right from wrong, make mistakes, fall in love, enjoy strawberries and cream, make someone fall in love with it, learn from experience, use words properly, be the subject of its own thought, have as much diversity of behaviour as a man, do something really new.</p></blockquote>Turing notes that "no support is usually offered for these statements," and that they depend on naive assumptions about how versatile machines may be in the future, or are "disguised forms of the argument from consciousness." He chooses to answer a few of them: <ol><li><i>Machines cannot make mistakes.</i> He notes it's easy to program a machine to appear to make a mistake.</li> <li><i>A machine cannot be the subject of its own thought</i> (or can't be <a href="/wiki/Self-aware" class="mw-redirect" title="Self-aware">self-aware</a>). A program which can report on its internal states and processes, in the simple sense of a <a href="/wiki/Debugger" title="Debugger">debugger</a> program, can certainly be written. Turing asserts "a machine can undoubtably be its own subject matter."</li> <li><i>A machine cannot have much diversity of behaviour</i>. He notes that, with enough storage capacity, a computer can behave in an astronomical number of different ways.</li></ol></li> <li><i><a href="/wiki/Ada_Lovelace" title="Ada Lovelace">Lady Lovelace</a>'s Objection</i>: One of the most famous objections states that computers are incapable of originality. This is largely because, according to <a href="/wiki/Ada_Lovelace" title="Ada Lovelace">Ada Lovelace</a>, machines are incapable of independent learning.<blockquote><p>The Analytical Engine has no pretensions whatever to <i>originate</i> anything. It can do whatever <i>we know how to order it</i> to perform. It can follow analysis; but it has no power of anticipating any analytical relations or truths.<sup id="cite_ref-22" class="reference"><a href="#cite_note-22"><span class="cite-bracket">[</span>22<span class="cite-bracket">]</span></a></sup></p></blockquote> Turing suggests that Lovelace's objection can be reduced to the assertion that computers "can never take us by surprise" and argues that, to the contrary, computers could still surprise humans, in particular where the consequences of different facts are not immediately recognizable. Turing also argues that Lady Lovelace was hampered by the context from which she wrote, and if exposed to more contemporary scientific knowledge, it would become evident that the brain's storage is quite similar to that of a computer.</li> <li><i>Argument from continuity in the nervous system</i>: Modern <a href="/wiki/Neurological" class="mw-redirect" title="Neurological">neurological</a> research has shown that the brain is not digital. Even though <a href="/wiki/Neuron" title="Neuron">neurons</a> fire in an all-or-nothing pulse, both the exact timing of the pulse and the probability of the pulse occurring have analog components. Turing acknowledges this, but argues that any analog system can be simulated to a reasonable degree of accuracy given enough computing power. (<a href="/wiki/Philosopher" class="mw-redirect" title="Philosopher">Philosopher</a> <a href="/wiki/Hubert_Dreyfus" title="Hubert Dreyfus">Hubert Dreyfus</a> would make this argument against "the biological assumption" in 1972.)<sup id="cite_ref-23" class="reference"><a href="#cite_note-23"><span class="cite-bracket">[</span>23<span class="cite-bracket">]</span></a></sup></li> <li><i>Argument from the informality of behaviour</i>: This argument states that any system governed by laws will be predictable and therefore not truly intelligent. Turing replies by stating that this is confusing laws of behaviour with general rules of conduct, and that if on a broad enough scale (such as is evident in man) machine behaviour would become increasingly difficult to predict. He argues that, just because we can't immediately see what the laws are, does not mean that no such laws exist. He writes "we certainly know of no circumstances under which we could say, 'we have searched enough. There are no such laws.'". (<a href="/wiki/Hubert_Dreyfus" title="Hubert Dreyfus">Hubert Dreyfus</a> would argue in 1972 that human reason and problem solving was not based on formal rules, but instead relied on instincts and awareness that would never be captured in rules. More recent AI research in <a href="/wiki/Robotics" title="Robotics">robotics</a> and <a href="/wiki/Computational_intelligence" title="Computational intelligence">computational intelligence</a> attempts to find the complex rules that govern our "informal" and unconscious skills of perception, mobility and pattern matching. See <a href="/wiki/Dreyfus%27_critique_of_AI" class="mw-redirect" title="Dreyfus' critique of AI">Dreyfus' critique of AI</a>).<sup id="cite_ref-24" class="reference"><a href="#cite_note-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup> This rejoinder also includes the <a href="/wiki/Turing%27s_Wager" title="Turing's Wager">Turing's Wager</a> argument.</li> <li><i><a href="/wiki/Extra-sensory_perception" class="mw-redirect" title="Extra-sensory perception">Extra-sensory perception</a></i>: In 1950, extra-sensory perception was an active area of research and Turing chooses to give ESP the benefit of the doubt, arguing that conditions could be created in which <a href="/wiki/Telepathy" title="Telepathy">mind-reading</a> would not affect the test. Turing admitted to "overwhelming statistical evidence" for telepathy, likely referring to early 1940s experiments by <a href="/wiki/Samuel_Soal" title="Samuel Soal">Samuel Soal</a>, a member of the <a href="/wiki/Society_for_Psychical_Research" title="Society for Psychical Research">Society for Psychical Research</a>.<sup id="cite_ref-25" class="reference"><a href="#cite_note-25"><span class="cite-bracket">[</span>25<span class="cite-bracket">]</span></a></sup></li></ol> <div class="mw-heading mw-heading2"><h2 id="Learning_machines">Learning machines</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=4" title="Edit section: Learning machines"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></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/Machine_learning" title="Machine learning">Machine learning</a></div> <p>In the final section of the paper Turing details his thoughts about the Learning Machine that could play the imitation game successfully. </p><p>Here Turing first returns to Lady Lovelace's objection that the machine can only do what we tell it to do and he likens it to a situation where a man "injects" an idea into the machine to which the machine responds and then falls off into quiescence. He extends on this thought by an analogy to an atomic pile of less than critical size, which is to be considered the machine, and an injected idea is to correspond to a <a href="/wiki/Neutron" title="Neutron">neutron</a> entering the pile from outside the pile; the neutron will cause a certain disturbance which eventually dies away. Turing then builds on that analogy and mentions that, if the <a href="/wiki/Critical_mass" title="Critical mass">size</a> of the pile were to be sufficiently large, then a neutron entering the pile would cause a disturbance that would continue to increase until the whole pile were destroyed, the pile would be supercritical. Turing then asks the question as to whether this analogy of a super critical pile could be extended to a human mind and then to a machine. He concludes that such an analogy would indeed be suitable for the human mind with "There does seem to be one for the human mind. The majority of them seem to be "subcritical," i.e., to correspond in this analogy to piles of sub critical size. An idea presented to such a mind will on average give rise to less than one idea in reply. A smallish proportion are supercritical. An idea presented to such a mind that may give rise to a whole "theory" consisting of secondary, tertiary and more remote ideas". He finally asks if a machine could be made to be supercritical. </p><p>Turing then mentions that the task of being able to create a machine that could play the imitation game is one of programming and he postulates that by the end of the century it will indeed be technologically possible to program a machine to play the game. He then mentions that in the process of trying to imitate an adult human mind it becomes important to consider the processes that lead to the adult mind being in its present state; which he summarizes as: </p> <dl><dd><dl><dd>1. The initial state of the mind, say at birth,</dd> <dd>2. The education to which it has been subjected,</dd> <dd>3. Other experience, not to be described as education, to which it has been subjected.</dd></dl></dd></dl> <p>Given this process he asks whether it would be more appropriate to program a child's mind instead of an adult’s mind and then subject the child mind to a period of education. He likens the child to a newly bought notebook and speculates that due to its simplicity it would be more easily programmed. The problem then is broken down into two parts, the programming of a child mind and its education process. He mentions that a child mind would not be expected as desired by the experimenter (programmer) at the first attempt. A learning process that involves a method of reward and punishment must be in place that will select desirable patterns in the mind. This whole process, Turing mentions, to a large extent is similar to that of evolution by natural selection where the similarities are: </p> <dl><dd><dl><dd>Structure of the child machine = hereditary material</dd> <dd>Changes of the child machine = mutations</dd> <dd>Natural selection = judgment of the experimenter</dd></dl></dd></dl> <p>Following this discussion Turing addresses certain specific aspects of the learning machine: </p> <dl><dd><ul><li>Nature of inherent complexity: The child machine could either be one that is as simple as possible, merely maintaining consistency with general principles, or the machine could be one with a complete system of logical inference programmed into it. This more complex system is explained by Turing as "..would be such that the machines store would be largely occupied with definitions and <a href="/wiki/Proposition" title="Proposition">propositions</a>. The propositions would have various kinds of status, e.g., well-established facts, conjectures, mathematically proved theorems, statements given by an authority, expressions having the logical form of proposition but not belief-value. Certain propositions may be described as "imperatives." The machine should be so constructed that as soon as an imperative is classed as "well established" the appropriate action automatically takes place". Despite this built-in logic system the logical inference programmed in would not be one that is formal, rather it would be one that is more pragmatic. In addition the machine would build on its built-in logic system by a method of "scientific induction".</li></ul></dd></dl> <dl><dd><ul><li>Ignorance of the experimenter: An important feature of a learning machine that Turing points out is the ignorance of the teacher of the machines' internal state during the learning process. This is in contrast to a conventional discrete state machine where the objective is to have a clear understanding of the internal state of the machine at every moment during the computation. The machine will be seen to be doing things that we often cannot make sense of or something that we consider to be completely random. Turing mentions that this specific character bestows upon a machine a certain degree of what we consider to be intelligence, in that intelligent behaviour consists of a deviation from the complete determinism of conventional computation but only so long as the deviation does not give rise to pointless loops or random behaviour.</li></ul></dd></dl> <dl><dd><ul><li>The importance of random behaviour: Though Turing cautions us of random behaviour he mentions that inculcating an element of randomness in a learning machine would be of value in a system. He mentions that this could be of value where there might be multiple correct answers or ones where it might be such that a systematic approach would investigate several unsatisfactory solutions to a problem before finding the optimal solution which would entail the systematic process inefficient. Turing also mentions that the process of evolution takes the path of random mutations in order to find solutions that benefit an organism but he also admits that in the case of evolution the systematic method of finding a solution would not be possible.</li></ul></dd></dl> <p>Turing concludes by speculating about a time when machines will compete with humans on numerous intellectual tasks and suggests tasks that could be used to make that start. Turing then suggests that abstract tasks such as playing chess could be a good place to start another method which he puts as "..it is best to provide the machine with the best sense organs that money can buy, and then teach it to understand and speak English.". </p><p>An examination of the development in <a href="/wiki/Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a> that has followed reveals that the learning machine did take the abstract path suggested by Turing as in the case of <a href="/wiki/Deep_Blue_(chess_computer)" title="Deep Blue (chess computer)">Deep Blue</a>, a chess playing computer developed by <a href="/wiki/IBM" title="IBM">IBM</a> and one which defeated the world champion <a href="/wiki/Garry_Kasparov" title="Garry Kasparov">Garry Kasparov</a> (though, this too is controversial) and the numerous computer chess games which can outplay most amateurs.<sup id="cite_ref-ParsingTT2008_26-0" class="reference"><a href="#cite_note-ParsingTT2008-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup> As for the second suggestion Turing makes, it has been likened by some authors as a call to finding a <a href="/wiki/Simulacrum" title="Simulacrum">simulacrum</a> of human cognitive development.<sup id="cite_ref-ParsingTT2008_26-1" class="reference"><a href="#cite_note-ParsingTT2008-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup> Such attempts at finding the underlying algorithms by which children learn the features of the world around them are only beginning to be made.<sup id="cite_ref-ParsingTT2008_26-2" class="reference"><a href="#cite_note-ParsingTT2008-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-27" class="reference"><a href="#cite_note-27"><span class="cite-bracket">[</span>27<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-28" class="reference"><a href="#cite_note-28"><span class="cite-bracket">[</span>28<span class="cite-bracket">]</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Notes">Notes</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=5" title="Edit section: Notes"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></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"> <div class="mw-references-wrap mw-references-columns"><ol class="references"> <li id="cite_note-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-1">^</a></b></span> <span class="reference-text"><a href="#CITEREFTuring1950">Turing 1950</a>, p. 433</span> </li> <li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text"><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 id="CITEREFOppyDowe2021" class="citation cs2">Oppy, Graham; Dowe, David (2021), <a rel="nofollow" class="external text" href="https://plato.stanford.edu/archives/win2021/entriesuring-test/">"The Turing Test"</a>, in Zalta, Edward N. (ed.), <i>The Stanford Encyclopedia of Philosophy</i> (Winter 2021 ed.), Metaphysics Research Lab, Stanford University<span class="reference-accessdate">, retrieved <span class="nowrap">6 August</span> 2023</span></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=The+Stanford+Encyclopedia+of+Philosophy&rft.edition=Winter+2021&rft.pub=Metaphysics+Research+Lab%2C+Stanford+University&rft.date=2021&rft.aulast=Oppy&rft.aufirst=Graham&rft.au=Dowe%2C+David&rft_id=https%3A%2F%2Fplato.stanford.edu%2Farchives%2Fwin2021%2Fentriesuring-test%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span><sup class="noprint Inline-Template"><span style="white-space: nowrap;">[<i><a href="/wiki/Wikipedia:Link_rot" title="Wikipedia:Link rot"><span title=" Dead link tagged December 2023">permanent dead link</span></a></i><span style="visibility:hidden; color:transparent; padding-left:2px">‍</span>]</span></sup></span> </li> <li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text"><a href="#CITEREFTuring1950">Turing 1950</a>, p. 434</span> </li> <li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text">This describes the simplest version of the test. For a more detailed discussion, see <a href="/wiki/Turing_test#Versions" title="Turing test">Versions of the Turing test</a>.</span> </li> <li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text">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)</span> </li> <li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><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), <i>Cybernetics: Key Papers</i>, 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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li></ul> </span></li> <li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHarnad2008" class="citation cs2">Harnad, Stevan (2008), <a rel="nofollow" class="external text" href="http://eprints.ecs.soton.ac.uk/12954/">"The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence"</a>, in Epstein, Robert; Peters, Grace (eds.), <i>The Turing Test Sourcebook: Philosophical and Methodological Issues in the Quest for the Thinking Computer</i>, Kluwer</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=Kluwer&rft.date=2008&rft.aulast=Harnad&rft.aufirst=Stevan&rft_id=http%3A%2F%2Feprints.ecs.soton.ac.uk%2F12954%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHarnad2001" class="citation cs2">Harnad, Stevan (2001), <a rel="nofollow" class="external text" href="http://cogprints.org/2615/">"Minds, Machines, and Turing: The Indistinguishability of Indistinguishables"</a>, <i>Journal of Logic, Language and Information</i>, <b>9</b> (4): 425–445, <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%3A1008315308862">10.1023/A:1008315308862</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:1911720">1911720</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=Minds%2C+Machines%2C+and+Turing%3A+The+Indistinguishability+of+Indistinguishables&rft.volume=9&rft.issue=4&rft.pages=425-445&rft.date=2001&rft_id=info%3Adoi%2F10.1023%2FA%3A1008315308862&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A1911720%23id-name%3DS2CID&rft.aulast=Harnad&rft.aufirst=Stevan&rft_id=http%3A%2F%2Fcogprints.org%2F2615%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="ieee_fedcsis" class="citation conference cs1">Swiechowski, Maciej (2020). <a rel="nofollow" class="external text" href="https://annals-csis.org/proceedings/2020/pliks/126.pdf">"Game AI Competitions: Motivation for the Imitation Game-Playing Competition"</a> <span class="cs1-format">(PDF)</span>. <i>Proceedings of the 2020 Federated Conference on Computer Science and Information Systems</i>. IEEE Publishing. pp. 155–160. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.15439%2F2020F126">10.15439/2020F126</a></span>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-83-955416-7-4" title="Special:BookSources/978-83-955416-7-4"><bdi>978-83-955416-7-4</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:222296354">222296354</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20210126184536/https://annals-csis.org/proceedings/2020/pliks/126.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on 26 January 2021<span class="reference-accessdate">. Retrieved <span class="nowrap">8 September</span> 2020</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=conference&rft.atitle=Game+AI+Competitions%3A+Motivation+for+the+Imitation+Game-Playing+Competition&rft.btitle=Proceedings+of+the+2020+Federated+Conference+on+Computer+Science+and+Information+Systems&rft.pages=155-160&rft.pub=IEEE+Publishing&rft.date=2020&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A222296354%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.15439%2F2020F126&rft.isbn=978-83-955416-7-4&rft.aulast=Swiechowski&rft.aufirst=Maciej&rft_id=https%3A%2F%2Fannals-csis.org%2Fproceedings%2F2020%2Fpliks%2F126.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text"><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>, <i>iTWire</i>, <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<span class="reference-accessdate">, retrieved <span class="nowrap">10 February</span> 2010</span></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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><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>, <i>V3</i>, <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<span class="reference-accessdate">, retrieved <span class="nowrap">10 February</span> 2010</span></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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-fortune_lambda-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-fortune_lambda_12-0">^</a></b></span> <span class="reference-text"><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>. <i>Fortune</i>. <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<span class="reference-accessdate">. Retrieved <span class="nowrap">13 June</span> 2022</span>.</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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-NMR-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-NMR_13-0">^</a></b></span> <span class="reference-text">Wardrip-Fruin, Noah and Nick Montfort, ed (2003). The New Media Reader. The MIT Press. <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/0-262-23227-8" title="Special:BookSources/0-262-23227-8">0-262-23227-8</a>.</span> </li> <li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHarnad1992" class="citation cs2">Harnad, Stevan (1992), <a rel="nofollow" class="external text" href="http://cogprints.org/1584/">"The Turing Test Is Not A Trick: Turing Indistinguishability Is A Scientific Criterion"</a>, <i>ACM SIGART Bulletin</i>, <b>3</b> (4): 9–10, <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.141422">10.1145/141420.141422</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:36356326">36356326</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+Is+Not+A+Trick%3A+Turing+Indistinguishability+Is+A+Scientific+Criterion&rft.volume=3&rft.issue=4&rft.pages=9-10&rft.date=1992&rft_id=info%3Adoi%2F10.1145%2F141420.141422&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A36356326%23id-name%3DS2CID&rft.aulast=Harnad&rft.aufirst=Stevan&rft_id=http%3A%2F%2Fcogprints.org%2F1584%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-P442-15"><span class="mw-cite-backlink">^ <a href="#cite_ref-P442_15-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-P442_15-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><a href="#CITEREFTuring1950">Turing 1950</a>, p. 442</span> </li> <li id="cite_note-P436-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-P436_16-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFTuring1950">Turing 1950</a>, p. 436</span> </li> <li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><a href="#CITEREFTuring1950">Turing 1950</a> see <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, p. 948 where comment "Turing examined a wide variety of possible objections to the possibility of intelligent machines, including virtually all of those that have been raised in the half century since his paper appeared."</span> </li> <li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><a href="#CITEREFLucas1961">Lucas 1961</a>, <a href="#CITEREFPenrose1989">Penrose 1989</a>, <a href="#CITEREFHofstadter1979">Hofstadter 1979</a>, pp. 471–473, 476–477 and <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 949–950. Russell and Norvig identify Lucas and Penrose's arguments as being the same one answered by Turing.</span> </li> <li id="cite_note-19"><span class="mw-cite-backlink"><b><a href="#cite_ref-19">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation journal cs1"><a rel="nofollow" class="external text" href="https://doi.org/10.1038%2F162138e0">"Announcements"</a>. <i>Nature</i>. <b>162</b> (4108): 138. 1948. <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/1948Natur.162U.138.">1948Natur.162U.138.</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1038%2F162138e0">10.1038/162138e0</a></span>.</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=Announcements&rft.volume=162&rft.issue=4108&rft.pages=138&rft.date=1948&rft_id=info%3Adoi%2F10.1038%2F162138e0&rft_id=info%3Abibcode%2F1948Natur.162U.138.&rft_id=https%3A%2F%2Fdoi.org%2F10.1038%252F162138e0&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-20"><span class="mw-cite-backlink"><b><a href="#cite_ref-20">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJefferson1949" class="citation journal cs1">Jefferson, Geoffrey (25 June 1949). <a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2050428">"The Mind of Mechanical Man"</a>. <i>British Medical Journal</i>. <b>1</b> (4616): 1105–1110. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1136%2Fbmj.1.4616.1105">10.1136/bmj.1.4616.1105</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/0007-1447">0007-1447</a>. <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2050428">2050428</a></span>. <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/18153422">18153422</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=British+Medical+Journal&rft.atitle=The+Mind+of+Mechanical+Man&rft.volume=1&rft.issue=4616&rft.pages=1105-1110&rft.date=1949-06-25&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC2050428%23id-name%3DPMC&rft.issn=0007-1447&rft_id=info%3Apmid%2F18153422&rft_id=info%3Adoi%2F10.1136%2Fbmj.1.4616.1105&rft.aulast=Jefferson&rft.aufirst=Geoffrey&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC2050428&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-21"><span class="mw-cite-backlink"><b><a href="#cite_ref-21">^</a></b></span> <span class="reference-text"><a href="#CITEREFSearle1980">Searle 1980</a> and <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 958–960, who identify Searle's argument with the one Turing answers.</span> </li> <li id="cite_note-22"><span class="mw-cite-backlink"><b><a href="#cite_ref-22">^</a></b></span> <span class="reference-text"><a href="https://en.wikisource.org/wiki/Scientific_Memoirs/3/Sketch_of_the_Analytical_Engine_invented_by_Charles_Babbage,_Esq./Notes_by_the_Translator" class="extiw" title="wikisource:Scientific Memoirs/3/Sketch of the Analytical Engine invented by Charles Babbage, Esq./Notes by the Translator">Scientific Memoirs edited by Richard Taylor (1781–1858), Volume 3, Sketch of the Analytical Engine invented by Charles Babbage, Esq, Notes by the Translator, by Augusta Ada Lovelace. 1843</a></span> </li> <li id="cite_note-23"><span class="mw-cite-backlink"><b><a href="#cite_ref-23">^</a></b></span> <span class="reference-text"><a href="#CITEREFDreyfus1979">Dreyfus 1979</a>, p. 156</span> </li> <li id="cite_note-24"><span class="mw-cite-backlink"><b><a href="#cite_ref-24">^</a></b></span> <span class="reference-text"><a href="#CITEREFDreyfus1972">Dreyfus 1972</a>, <a href="#CITEREFDreyfusDreyfus1986">Dreyfus & Dreyfus 1986</a>, <a href="#CITEREFMoravec1988">Moravec 1988</a> and <a href="#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 51–52, who identify Dreyfus' argument with the one Turing answers.</span> </li> <li id="cite_note-25"><span class="mw-cite-backlink"><b><a href="#cite_ref-25">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLeavitt2017" class="citation cs2">Leavitt, David (26 January 2017), <a rel="nofollow" class="external text" href="https://academic.oup.com/book/40646/chapter/348321617">"Turing and the paranormal"</a>, <i>The Turing Guide</i>, Oxford University Press, <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%2Foso%2F9780198747826.003.0042">10.1093/oso/9780198747826.003.0042</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-19-874782-6" title="Special:BookSources/978-0-19-874782-6"><bdi>978-0-19-874782-6</bdi></a><span class="reference-accessdate">, retrieved <span class="nowrap">23 July</span> 2023</span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=The+Turing+Guide&rft.atitle=Turing+and+the+paranormal&rft.date=2017-01-26&rft_id=info%3Adoi%2F10.1093%2Foso%2F9780198747826.003.0042&rft.isbn=978-0-19-874782-6&rft.aulast=Leavitt&rft.aufirst=David&rft_id=https%3A%2F%2Facademic.oup.com%2Fbook%2F40646%2Fchapter%2F348321617&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-ParsingTT2008-26"><span class="mw-cite-backlink">^ <a href="#cite_ref-ParsingTT2008_26-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-ParsingTT2008_26-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-ParsingTT2008_26-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEpsteinRobertsBeber2008" class="citation book cs1">Epstein, Robert; Roberts, Gary; Beber, Grace (2008). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=aggUJL_5_oQC"><i>Parsing the Turing Test:Philosophical and Methodological Issues in the Quest for the Thinking Computer</i></a>. Springer. p. 65. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-4020-6710-5" title="Special:BookSources/978-1-4020-6710-5"><bdi>978-1-4020-6710-5</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Parsing+the+Turing+Test%3APhilosophical+and+Methodological+Issues+in+the+Quest+for+the+Thinking+Computer&rft.pages=65&rft.pub=Springer&rft.date=2008&rft.isbn=978-1-4020-6710-5&rft.aulast=Epstein&rft.aufirst=Robert&rft.au=Roberts%2C+Gary&rft.au=Beber%2C+Grace&rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DaggUJL_5_oQC&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-27"><span class="mw-cite-backlink"><b><a href="#cite_ref-27">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGopnikMeltzoff1997" class="citation book cs1"><a href="/wiki/Alison_Gopnik" title="Alison Gopnik">Gopnik, Alison</a>; <a href="/wiki/Andrew_N._Meltzoff" title="Andrew N. Meltzoff">Meltzoff, Andrew N.</a> (1997). <a rel="nofollow" class="external text" href="http://mitpress.mit.edu/books/words-thoughts-and-theories"><i>Words, thoughts, and theories</i></a>. Learning, Development, and Conceptual Change. MIT Press. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/9780262071758" title="Special:BookSources/9780262071758"><bdi>9780262071758</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Words%2C+thoughts%2C+and+theories.&rft.series=Learning%2C+Development%2C+and+Conceptual+Change&rft.pub=MIT+Press&rft.date=1997&rft.isbn=9780262071758&rft.aulast=Gopnik&rft.aufirst=Alison&rft.au=Meltzoff%2C+Andrew+N.&rft_id=http%3A%2F%2Fmitpress.mit.edu%2Fbooks%2Fwords-thoughts-and-theories&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> <li id="cite_note-28"><span class="mw-cite-backlink"><b><a href="#cite_ref-28">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMeltzoff1999" class="citation journal cs1">Meltzoff, Andrew N. (1999). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20210415081358/http://ilabs.washington.edu/meltzoff/pdf/99Meltzoff_JCommDisord.pdf">"Origins of theory of mind, cognition and communication"</a> <span class="cs1-format">(PDF)</span>. <i>Journal of Communication Disorders</i>. <b>32</b> (4): 251–269. <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%2FS0021-9924%2899%2900009-X">10.1016/S0021-9924(99)00009-X</a>. <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3629913">3629913</a></span>. <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/10466097">10466097</a>. Archived from <a rel="nofollow" class="external text" href="http://ilabs.washington.edu/meltzoff/pdf/99Meltzoff_JCommDisord.pdf">the original</a> <span class="cs1-format">(PDF)</span> on 15 April 2021<span class="reference-accessdate">. Retrieved <span class="nowrap">27 November</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Communication+Disorders&rft.atitle=Origins+of+theory+of+mind%2C+cognition+and+communication.&rft.volume=32&rft.issue=4&rft.pages=251-269&rft.date=1999&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC3629913%23id-name%3DPMC&rft_id=info%3Apmid%2F10466097&rft_id=info%3Adoi%2F10.1016%2FS0021-9924%2899%2900009-X&rft.aulast=Meltzoff&rft.aufirst=Andrew+N.&rft_id=http%3A%2F%2Filabs.washington.edu%2Fmeltzoff%2Fpdf%2F99Meltzoff_JCommDisord.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></span> </li> </ol></div></div> <div class="mw-heading mw-heading2"><h2 id="References">References</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=6" title="Edit section: References"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrooks1990" class="citation cs2"><a href="/wiki/Rodney_Brooks" title="Rodney Brooks">Brooks, Rodney</a> (1990), <a rel="nofollow" class="external text" href="http://people.csail.mit.edu/brooks/papers/elephants.pdf">"Elephants Don't Play Chess"</a> <span class="cs1-format">(PDF)</span>, <i>Robotics and Autonomous Systems</i>, <b>6</b> (1–2): 3–15, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.7539">10.1.1.588.7539</a></span>, <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%2FS0921-8890%2805%2980025-9">10.1016/S0921-8890(05)80025-9</a><span class="reference-accessdate">, retrieved <span class="nowrap">30 August</span> 2007</span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Robotics+and+Autonomous+Systems&rft.atitle=Elephants+Don%27t+Play+Chess&rft.volume=6&rft.issue=1%E2%80%932&rft.pages=3-15&rft.date=1990&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.588.7539%23id-name%3DCiteSeerX&rft_id=info%3Adoi%2F10.1016%2FS0921-8890%2805%2980025-9&rft.aulast=Brooks&rft.aufirst=Rodney&rft_id=http%3A%2F%2Fpeople.csail.mit.edu%2Fbrooks%2Fpapers%2Felephants.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCrevier1993" class="citation book cs1"><a href="/wiki/Daniel_Crevier" title="Daniel Crevier">Crevier, Daniel</a> (1993). <i>AI: The Tumultuous Search for Artificial Intelligence</i>. New York, NY: BasicBooks. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/0-465-02997-3" title="Special:BookSources/0-465-02997-3"><bdi>0-465-02997-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=AI%3A+The+Tumultuous+Search+for+Artificial+Intelligence&rft.place=New+York%2C+NY&rft.pub=BasicBooks&rft.date=1993&rft.isbn=0-465-02997-3&rft.aulast=Crevier&rft.aufirst=Daniel&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDreyfus1972" class="citation cs2"><a href="/wiki/Hubert_Dreyfus" title="Hubert Dreyfus">Dreyfus, Hubert</a> (1972), <a href="/wiki/What_Computers_Can%27t_Do" class="mw-redirect" title="What Computers Can't Do"><i>What Computers Can't Do</i></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-011082-6" title="Special:BookSources/978-0-06-011082-6"><bdi>978-0-06-011082-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=What+Computers+Can%27t+Do&rft.place=New+York&rft.pub=MIT+Press&rft.date=1972&rft.isbn=978-0-06-011082-6&rft.aulast=Dreyfus&rft.aufirst=Hubert&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDreyfusDreyfus1986" class="citation cs2"><a href="/wiki/Hubert_Dreyfus" title="Hubert Dreyfus">Dreyfus, Hubert</a>; Dreyfus, Stuart (1986), <i>Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer</i>, Oxford, UK: Blackwell</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Mind+over+Machine%3A+The+Power+of+Human+Intuition+and+Expertise+in+the+Era+of+the+Computer&rft.place=Oxford%2C+UK&rft.pub=Blackwell&rft.date=1986&rft.aulast=Dreyfus&rft.aufirst=Hubert&rft.au=Dreyfus%2C+Stuart&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></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), <i>What Computers </i>Still<i> Can't Do</i>, New York: MIT Press</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.aulast=Dreyfus&rft.aufirst=Hubert&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHarnadScherzer2008" class="citation cs2"><a href="/wiki/Stevan_Harnad" title="Stevan Harnad">Harnad, Stevan</a>; Scherzer, Peter (2008), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20120208075237/http://eprints.ecs.soton.ac.uk/14430/">"First, Scale Up to the Robotic Turing Test, Then Worry About Feeling"</a>, <i>Artificial Intelligence in Medicine</i>, <b>44</b> (2): 83–9, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.4269">10.1.1.115.4269</a></span>, <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.artmed.2008.08.008">10.1016/j.artmed.2008.08.008</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/18930641">18930641</a>, archived from <a rel="nofollow" class="external text" href="http://eprints.ecs.soton.ac.uk/14430/">the original</a> on 8 February 2012<span class="reference-accessdate">, retrieved <span class="nowrap">29 August</span> 2010</span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Artificial+Intelligence+in+Medicine&rft.atitle=First%2C+Scale+Up+to+the+Robotic+Turing+Test%2C+Then+Worry+About+Feeling&rft.volume=44&rft.issue=2&rft.pages=83-9&rft.date=2008&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.115.4269%23id-name%3DCiteSeerX&rft_id=info%3Apmid%2F18930641&rft_id=info%3Adoi%2F10.1016%2Fj.artmed.2008.08.008&rft.aulast=Harnad&rft.aufirst=Stevan&rft.au=Scherzer%2C+Peter&rft_id=http%3A%2F%2Feprints.ecs.soton.ac.uk%2F14430%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span>.</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), <i>Artificial Intelligence: The Very Idea</i>, Cambridge, Mass.: 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+Mass.&rft.pub=MIT+Press&rft.date=1985&rft.aulast=Haugeland&rft.aufirst=John&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoravec1976" class="citation cs2"><a href="/wiki/Hans_Moravec" title="Hans Moravec">Moravec, Hans</a> (1976), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160303232511/http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html"><i>The Role of Raw Power in Intelligence</i></a>, archived from <a rel="nofollow" class="external text" href="http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html">the original</a> on 3 March 2016<span class="reference-accessdate">, retrieved <span class="nowrap">7 November</span> 2007</span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=The+Role+of+Raw+Power+in+Intelligence&rft.date=1976&rft.aulast=Moravec&rft.aufirst=Hans&rft_id=http%3A%2F%2Fwww.frc.ri.cmu.edu%2Fusers%2Fhpm%2Fproject.archive%2Fgeneral.articles%2F1975%2FRaw.Power.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHofstadter1979" class="citation cs2"><a href="/wiki/Douglas_Hofstadter" title="Douglas Hofstadter">Hofstadter, Douglas</a> (1979), <a href="/wiki/G%C3%B6del,_Escher,_Bach" title="Gödel, Escher, Bach"><i>Gödel, Escher, Bach: an Eternal Golden Braid</i></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=G%C3%B6del%2C+Escher%2C+Bach%3A+an+Eternal+Golden+Braid&rft.date=1979&rft.aulast=Hofstadter&rft.aufirst=Douglas&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLucas1961" class="citation cs2"><a href="/wiki/John_Lucas_(philosopher)" title="John Lucas (philosopher)">Lucas, John</a> (1961), "Minds, Machines and Gödel", in Anderson, A.R. (ed.), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html"><i>Minds and Machines</i></a>, archived from <a rel="nofollow" class="external text" href="http://users.ox.ac.uk/~jrlucas/Godel/mmg.html">the original</a> on 19 August 2007<span class="reference-accessdate">, retrieved <span class="nowrap">2 December</span> 2022</span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Minds%2C+Machines+and+G%C3%B6del&rft.btitle=Minds+and+Machines&rft.date=1961&rft.aulast=Lucas&rft.aufirst=John&rft_id=http%3A%2F%2Fusers.ox.ac.uk%2F~jrlucas%2FGodel%2Fmmg.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoravec1988" class="citation cs2"><a href="/wiki/Hans_Moravec" title="Hans Moravec">Moravec, Hans</a> (1988), <i>Mind Children</i>, Harvard University Press</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Mind+Children&rft.pub=Harvard+University+Press&rft.date=1988&rft.aulast=Moravec&rft.aufirst=Hans&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></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"><i>The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics</i></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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></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/"><i>Artificial Intelligence: A Modern Approach</i></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%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></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://home.csulb.edu/~cwallis/382/readings/482/searle.minds.brains.programs.bbs.1980.pdf">"Minds, Brains and Programs"</a> <span class="cs1-format">(PDF)</span>, <i>Behavioral and Brain Sciences</i>, <b>3</b> (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></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=https%3A%2F%2Fhome.csulb.edu%2F~cwallis%2F382%2Freadings%2F482%2Fsearle.minds.brains.programs.bbs.1980.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuring1950" class="citation cs2"><a href="/wiki/Alan_Turing" title="Alan Turing">Turing, Alan</a> (October 1950), <a rel="nofollow" class="external text" href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf">"Computing Machinery and Intelligence"</a> <span class="cs1-format">(PDF)</span>, <i>Mind</i>, <b>LIX</b> (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></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=LIX&rft.issue=236&rft.pages=433-460&rft.date=1950-10&rft_id=info%3Adoi%2F10.1093%2Fmind%2FLIX.236.433&rft.aulast=Turing&rft.aufirst=Alan&rft_id=https%3A%2F%2Fwww.csee.umbc.edu%2Fcourses%2F471%2Fpapers%2Fturing.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSaygin2000" class="citation journal cs1">Saygin, A. P. (2000). "Turing Test: 50 years later". <i>Minds and Machines</i>. <b>10</b> (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>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://hdl.handle.net/11693%2F24987">11693/24987</a></span>. <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>.</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.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li> <li><a href="/wiki/Noah_Wardrip-Fruin" title="Noah Wardrip-Fruin">Noah Wardrip-Fruin</a> and Nick Montfort, eds. (2003). <i>The New Media Reader</i>. Cambridge: MIT Press. <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/0-262-23227-8" title="Special:BookSources/0-262-23227-8">0-262-23227-8</a>. "Lucasfilm's Habitat" pp. 663–677.</li></ul> <div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=7" title="Edit section: External links"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a rel="nofollow" class="external text" href="https://academic.oup.com/mind/article-pdf/LIX/236/433/9866119/433.pdf">PDF with the full text of the paper</a></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSayginCicekliAkman1999" class="citation journal cs1">Saygin, Ayse Pinar; Cicekli, Ilyas; Akman, Varol (1999). "An analysis and review of the next 50 years". <i>Minds and Machines</i>: 2000. <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.1592">10.1.1.157.1592</a></span>.</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=An+analysis+and+review+of+the+next+50+years&rft.pages=2000&rft.date=1999&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.157.1592%23id-name%3DCiteSeerX&rft.aulast=Saygin&rft.aufirst=Ayse+Pinar&rft.au=Cicekli%2C+Ilyas&rft.au=Akman%2C+Varol&rfr_id=info%3Asid%2Fen.wikipedia.org%3AComputing+Machinery+and+Intelligence" class="Z3988"></span></li></ul> <div class="navbox-styles"><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: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" aria-labelledby="Alan_Turing" style="padding:3px"><table class="nowraplinks hlist mw-collapsible mw-collapsed 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"><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: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 href="/wiki/Turing_test" title="Turing test">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 class="mw-selflink selflink">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=Computing_Machinery_and_Intelligence&oldid=1255984972">https://en.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&oldid=1255984972</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_documents" title="Category:1950 documents">1950 documents</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:Philosophy_of_artificial_intelligence" title="Category:Philosophy of artificial intelligence">Philosophy of artificial intelligence</a></li><li><a href="/wiki/Category:Artificial_intelligence_papers" title="Category:Artificial intelligence papers">Artificial intelligence papers</a></li><li><a href="/wiki/Category:Alan_Turing" title="Category:Alan Turing">Alan Turing</a></li><li><a href="/wiki/Category:Cognitive_science_literature" title="Category:Cognitive science literature">Cognitive science literature</a></li><li><a href="/wiki/Category:Works_originally_published_in_Mind_(journal)" title="Category:Works originally published in Mind (journal)">Works originally published in Mind (journal)</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: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_December_2023" title="Category:Articles with dead external links from December 2023">Articles with dead external links from December 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_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_dmy_dates_from_April_2018" title="Category:Use dmy dates from April 2018">Use dmy dates from April 2018</a></li><li><a href="/wiki/Category:Use_British_English_from_April_2018" title="Category:Use British English from April 2018">Use British English from April 2018</a></li><li><a href="/wiki/Category:Pages_with_broken_anchors" title="Category:Pages with broken anchors">Pages with broken anchors</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 7 November 2024, at 16:42<span class="anonymous-show"> (UTC)</span>.</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=Computing_Machinery_and_Intelligence&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-f7b5ccf54-46s8l","wgBackendResponseTime":157,"wgPageParseReport":{"limitreport":{"cputime":"0.744","walltime":"0.866","ppvisitednodes":{"value":3105,"limit":1000000},"postexpandincludesize":{"value":82353,"limit":2097152},"templateargumentsize":{"value":2635,"limit":2097152},"expansiondepth":{"value":17,"limit":100},"expensivefunctioncount":{"value":9,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":116082,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 790.024 1 -total"," 41.32% 326.455 1 Template:Reflist"," 27.16% 214.590 22 Template:Citation"," 17.19% 135.808 1 Template:Alan_Turing"," 16.83% 132.957 1 Template:Navbox"," 9.25% 73.103 1 Template:Short_description"," 8.95% 70.727 17 Template:Harvnb"," 5.81% 45.877 5 Template:Cite_journal"," 5.53% 43.652 2 Template:Pagetype"," 5.47% 43.210 2 Template:Fix"]},"scribunto":{"limitreport-timeusage":{"value":"0.499","limit":"10.000"},"limitreport-memusage":{"value":8016018,"limit":52428800},"limitreport-logs":"anchor_id_list = table#1 {\n [\"CITEREFBrooks1990\"] = 1,\n [\"CITEREFDreyfus1972\"] = 1,\n [\"CITEREFDreyfus1979\"] = 1,\n [\"CITEREFDreyfusDreyfus1986\"] = 1,\n [\"CITEREFEpsteinRobertsBeber2008\"] = 1,\n [\"CITEREFEvansRobertson1968\"] = 1,\n [\"CITEREFGopnikMeltzoff1997\"] = 1,\n [\"CITEREFHarnad1992\"] = 1,\n [\"CITEREFHarnad2001\"] = 1,\n [\"CITEREFHarnad2008\"] = 1,\n [\"CITEREFHarnadScherzer2008\"] = 1,\n [\"CITEREFHaugeland1985\"] = 1,\n [\"CITEREFHofstadter1979\"] = 1,\n [\"CITEREFJefferson1949\"] = 1,\n [\"CITEREFJeremy_Kahn2022\"] = 1,\n [\"CITEREFLeavitt2017\"] = 1,\n [\"CITEREFLucas1961\"] = 1,\n [\"CITEREFMeltzoff1999\"] = 1,\n [\"CITEREFMoravec1976\"] = 1,\n [\"CITEREFMoravec1988\"] = 1,\n [\"CITEREFOppyDowe2021\"] = 1,\n [\"CITEREFPenrose1989\"] = 1,\n [\"CITEREFSaygin2000\"] = 1,\n [\"CITEREFSayginCicekliAkman1999\"] = 1,\n [\"CITEREFSearle1980\"] = 1,\n [\"CITEREFTuring1950\"] = 1,\n [\"CITEREFWilliams2007\"] = 1,\n [\"CITEREFWithers2007\"] = 1,\n [\"ieee_fedcsis\"] = 1,\n}\ntemplate_list = table#1 {\n [\"\\\" '\"] = 1,\n [\"' \\\"\"] = 1,\n [\"Alan Turing\"] = 1,\n [\"Broken anchor\"] = 1,\n [\"Citation\"] = 21,\n [\"Cite book\"] = 2,\n [\"Cite conference\"] = 1,\n [\"Cite journal\"] = 5,\n [\"Cite news\"] = 1,\n [\"Crevier 1993\"] = 1,\n [\"DEFAULTSORT:Computing Machinery And Intelligence\"] = 1,\n [\"Dead link\"] = 1,\n [\"Harv\"] = 1,\n [\"Harvid\"] = 1,\n [\"Harvnb\"] = 17,\n [\"ISBN\"] = 2,\n [\"Main\"] = 1,\n [\"Reflist\"] = 1,\n [\"Russell Norvig 2003\"] = 1,\n [\"See also\"] = 3,\n [\"Short description\"] = 1,\n [\"Use British English\"] = 1,\n [\"Use dmy dates\"] = 1,\n}\narticle_whitelist = table#1 {\n}\n"},"cachereport":{"origin":"mw-web.codfw.main-6b7f745dd4-nzdh9","timestamp":"20241125133617","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"Computing Machinery and Intelligence","url":"https:\/\/en.wikipedia.org\/wiki\/Computing_Machinery_and_Intelligence","sameAs":"http:\/\/www.wikidata.org\/entity\/Q772056","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q772056","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":"2003-12-16T09:35:05Z","dateModified":"2024-11-07T16:42:56Z","headline":"1950 article by Alan Turing on artificial intelligence that introduced the Turing test"}</script> </body> </html>