{"id":2547,"date":"2012-04-27T10:17:19","date_gmt":"2012-04-27T18:17:19","guid":{"rendered":"http:\/\/experimentalmath.info\/blog\/?p=2547"},"modified":"2012-07-01T13:05:20","modified_gmt":"2012-07-01T21:05:20","slug":"will-computers-soon-pass-the-turing-test","status":"publish","type":"post","link":"https:\/\/experimentalmath.info\/blog\/2012\/04\/will-computers-soon-pass-the-turing-test\/","title":{"rendered":"Is your mate actually a computer?   Would you pass the &#8220;Turing test&#8221;?"},"content":{"rendered":"<p>This year marks the 100th anniversary of the birth of famed British mathematician <a href=\"http:\/\/en.wikipedia.org\/wiki\/Alan_Turing\">Alan Turing<\/a>\u00a0(23 June 1912\u00a0\u2013 7 June 1954).\u00a0\u00a0The outline of his remarkable life and <a href=\"http:\/\/blog.jgc.org\/2011\/07\/complete-text-of-gordon-browns-apology.html\">sad ending<\/a>\u00a0has by now become fairly well known. Turing laid numerous foundation stones of modern computing, ranging from the deepest mathematical nature of computing (using what are now called Turing machines he provided the modern approach to incompleteness and undecidability) to specific issues of practical design; \u00a0he also contributed to <a href=\"http:\/\/www.wired.com\/wiredscience\/2011\/02\/turing-patterns\/\">mathematical biology<\/a>\u00a0(morphology) and much else. At the same time, he played a key role in the British government&#8217;s breaking of the German Enigma code at the now-fabled but then ultra-secret\u00a0<a href=\"http:\/\/www.bletchleypark.org.uk\/content\/machines.rhtm\">Bletchley Park<\/a>, thus arguably accelerating the end of World War II.<\/p>\n<div id=\"attachment_2640\" style=\"width: 240px\" class=\"wp-caption alignleft\"><a href=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/archiveiconlarge.jpg\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2640\" class=\" wp-image-2640  \" title=\"archiveiconlarge\" src=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/archiveiconlarge.jpg\" alt=\"\" width=\"230\" height=\"173\" srcset=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/archiveiconlarge.jpg 256w, https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/archiveiconlarge-150x112.jpg 150w\" sizes=\"auto, (max-width: 230px) 100vw, 230px\" \/><\/a><p id=\"caption-attachment-2640\" class=\"wp-caption-text\">Image from the Turing archive<\/p><\/div>\n<div id=\"attachment_2626\" style=\"width: 230px\" class=\"wp-caption alignright\"><a href=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Bombe-rebuild2.jpg\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2626\" class=\"size-full wp-image-2626 \" title=\"220px-Bombe-rebuild\" src=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Bombe-rebuild2.jpg\" alt=\"\" width=\"220\" height=\"165\" srcset=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Bombe-rebuild2.jpg 220w, https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Bombe-rebuild2-150x112.jpg 150w\" sizes=\"auto, (max-width: 220px) 100vw, 220px\" \/><\/a><p id=\"caption-attachment-2626\" class=\"wp-caption-text\">Turing&#39;s cryptographic &#39;bombe&#39;  as rebuilt  at Bletchley Park<\/p><\/div>\n<p style=\"text-align: center;\"><a href=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/run3.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter  wp-image-2660\" title=\"run\" src=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/run3-143x300.jpg\" alt=\"\" width=\"114\" height=\"240\" srcset=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/run3-143x300.jpg 143w, https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/run3-71x150.jpg 71w, https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/run3.jpg 150w\" sizes=\"auto, (max-width: 114px) 100vw, 114px\" \/><\/a><\/p>\n<p>\u00a0<span style=\"text-align: center;\"><br \/>\nTuring (see <\/span><a style=\"text-align: center;\" href=\"http:\/\/www.turing.org.uk\/turing\/index.html\">http:\/\/www.turing.org.uk<\/a><span style=\"text-align: center;\">)\u00a0was many other\u00a0<\/span><span style=\"text-align: center;\">things: a world class marathon runner, a troubled homosexual, and an atheist who famously said &#8220;The universe is a differential equation. Religion is an initial condition.&#8221; \u00a0Those who knew him savour Feynman-like anecdotes. His achievements are perhaps most succinctly summarized by Harvard scholar Steven Pinker, who <\/span><a style=\"text-align: center;\" href=\"http:\/\/www.amazon.com\/The-Better-Angels-Our-Nature\/dp\/0670022950\">declared<\/a><span style=\"text-align: center;\">:<\/span><\/p>\n<blockquote><p>It would be an exaggeration to say that the British mathematician Alan Turing explained the nature of logical and mathematical reasoning, invented the digital computer, solved the mind-body problem, and saved Western civilization. But it would not be much of an exaggeration.<\/p><\/blockquote>\n<p>One of Turing&#8217;s many signal contributions was a 1950 <a href=\"http:\/\/loebner.net\/Prizef\/TuringArticle.html\">article<\/a> that defined what is now known as the &#8220;Turning test.&#8221; In this article, he proposed a test in which a human &#8220;converses&#8221; with two entities &#8212; one human and one computer program &#8212; over a text-only channel (i.e., a computer keyboard\/screen), and then attempts to determine which is the human and which is the computer. If, after say five minutes of testing, the majority of human interrogators are unable to determine which is which, Turing said that we could claim that the computer system has achieved a certain level of intelligence.<\/p>\n<p>[Added on 24 Jun 2012:] Alan Turing&#8217;s brother wrote some memoirs of Alan&#8217;s life.  See this <a href=\"http:\/\/www.thedailybeast.com\/articles\/2012\/06\/23\/alan-turing-s-brother-he-should-be-alive-today.html\">report<\/a>.<\/p>\n<p>Turing&#8217;s article even anticipated several possible objections to his test, including mathematical and philosophical objections, which continue to be debated to the present day. For example, some potential questions might not be &#8220;fair&#8221; to a computer. And we all have human acquaintances who might be judged &#8220;computer&#8221; in such a test.<\/p>\n<p>In the decades since 1950, when Turing proposed the test, it has been widely influential in directing progress in the computing field in general and in artificial intelligence in particular. Some early attempts at Turing test programs pointed out both the promise and the perils of this enterprise. In 1966, Joseph Weizenbaum created a program, known as <a href=\"http:\/\/en.wikipedia.org\/wiki\/ELIZA\">ELIZA<\/a>, which identified keywords in text typed by a human, and then responded with some sort of clever but inquiring response, in the style of a psychologist interviewing a patient. Although some subjects were genuinely surprised to learn that the &#8220;psychologist&#8221; was a computer, to more skeptical testers its weaknesses quickly became evident. The present authors do remember enjoying playing with it when personal computers first allowed for relaxed therapy sessions.<\/p>\n<p>Progress in the field languished somewhat during the 1970s and 1980s, but since 1991 there has been an annual <a href=\"http:\/\/www.loebner.net\/Prizef\/loebner-prize.html\">Loebner Prize<\/a> in artificial intelligence in which ELIZA&#8217;s children &#8212; now called &#8220;chat-bots&#8221; &#8212; compete to pass the Turing test. Two recent advances have dramatically enhanced interest: (a) the ready availability of many terabytes of data, from technical documents on every conceivable topic to the growing personal databases of &#8220;lifeloggers&#8221;; and (b) sophisticated statistical techniques for organizing and classifying this data.<\/p>\n<p>This technology was perhaps most publicly brought to the public eye with the recent defeat of two champion human contestants on the American quiz show &#8220;Jeopardy!&#8221; by an IBM-developed computer system known as &#8220;Watson.&#8221; Additional details on Watson (both its Jeopardy! achievement and future commercialization plans) are available from the <a href=\"http:\/\/www-03.ibm.com\/innovation\/us\/watson\/what-is-watson\/index.html\">IBM Watson<\/a>\u00a0<a href=\"http:\/\/www-03.ibm.com\/innovation\/us\/watson\/what-is-watson\/index.html\">website<\/a> and also in a <a href=\"http:\/\/www.nytimes.com\/2010\/06\/20\/magazine\/20Computer-t.html?pagewanted=all\">New York Times article<\/a>. See also our previous blogs on Watson: <a href=\"https:\/\/experimentalmath.info\/blog\/2012\/03\/are-computers-playing-games-with-us\">Math Drudge #1<\/a> and <a href=\"https:\/\/experimentalmath.info\/blog\/2011\/02\/what-does-watsons-victory-really-mean\">Math Drudge #2<\/a>\u00a0and HuffPost article on <a href=\" http:\/\/www.huffingtonpost.com\/david-h-bailey\/computer-game-intelligence_b_1396377.htm\">Games computers play with us<\/a>.<\/p>\n<p>Watson is now rapidly moving into specializations for medicine and <a href=\"http:\/\/www.technewsworld.com\/story\/74923.html \">voice\u00a0recognition<\/a>\u00a0among other things. IBM clearly views Apple Computers&#8217; <a href=\"http:\/\/www.apple.com\/iphone\/features\/siri.html\">Siri assistant<\/a>, available with the iPhone 4S, as a main target of competition. Meanwhile Google and AT&amp;T are working on similar systems, according to a recent\u00a0<a href=\"http:\/\/www.pcadvisor.co.uk\/news\/network-wifi\/3352758\/att-watson-vs-apple-siri-talkin-about-smackdown\">UK report<\/a>. Among other things, Watson-type technology offers amazing opportunities as an intelligent assistant for <a href=\"https:\/\/theconversation.edu.au\/profiles\/jon-borwein-101\/dashboard#\">mathematical research<\/a>.<\/p>\n<p>So far no computer system has passed the Turing test, according to the strict rules of the <a href=\"http:\/\/www.loebner.net\/Prizef\/loebner-prize.html\">Loebner prize<\/a> competition, but they are getting close. The 2010 and 2011 competitions have been won by a chat-bot computer system known as &#8220;CHAT-L,&#8221; programmed by Bruce Wilcox. In 2010 this program actually fooled one of the four human judges into thinking it was human.<\/p>\n<p>All this raises the question of whether a computer system that finally passes the Turing test is really &#8220;conscious&#8221; or &#8220;human&#8221; in any sense. These issues were summarized by Robert M. French in a recent <a href=\"http:\/\/www.sciencemag.org\/content\/336\/6078\/164.summary?sid=9cdfe35f-a1fc-4e8e-9ca8-ab072a1421bd\">Science article<\/a>:<\/p>\n<blockquote><p>All of this brings us squarely back to the question first posed by Turing at the dawn of the computer age, one that has generated a flood of philosophical and scientific commentary ever since. No one would argue that computer-simulated chess playing, regardless of how it is achieved, is not chess playing. Is there something fundamentally different about computer-simulated intelligence?<\/p><\/blockquote>\n<p><span style=\"text-align: left;\">French is among the more pessimistic observers.  Others, such as futurist <a href=\"http:\/\/www.time.com\/time\/health\/article\/0,8599,2048138-1,00.html\">Ray Kurzweil<\/a> are much more expansive.  He predicts that in roughly the year 2045, machine intelligence will match then transcend human intelligence, resulting in a dizzying advance of technology that we can only dimly foresee at the present time. Kurzweil outlines this vision in his recent book <em>The Singularity Is Near<\/em>.<\/span><\/p>\n<p><span style=\"text-align: left;\">Only time will tell when Turing&#8217;s vision will be achieved.  But civilization will never be the same once it is.<\/span><\/p>\n<p style=\"text-align: center;\"><span style=\"text-align: left;\"><a href=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Turing_Plaque1.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-2665 aligncenter\" title=\"220px-Turing_Plaque\" src=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Turing_Plaque1.jpg\" alt=\"\" width=\"220\" height=\"165\" srcset=\"https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Turing_Plaque1.jpg 220w, https:\/\/experimentalmath.info\/blog\/wp-content\/uploads\/2012\/04\/220px-Turing_Plaque1-150x112.jpg 150w\" sizes=\"auto, (max-width: 220px) 100vw, 220px\" \/><\/a><\/span><\/p>\n<p>[Added 17 Jun 2012] The results of the 2012 Loebner Prize were just announced.  This year, none of the judges were fooled by any of the &#8220;bots.&#8221;  More details are available <a href=\"http:\/\/www.guardian.co.uk\/technology\/2012\/jun\/17\/alan-turings-legacy-thinking-machines\">here<\/a>.<\/p>\n<p>[A version of this article appeared in <a href=\"http:\/\/theconversation.edu.au\/person-or-computer-could-you-pass-the-turing-test-6769\">The Conversation<\/a>.]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>This year marks the 100th anniversary of the birth of famed British mathematician Alan Turing (23 June 1912 \u2013 7 June 1954). The outline of his remarkable life and sad ending has by now become fairly well known. Turing laid numerous foundation stones of modern computing, ranging from the deepest mathematical nature of computing (using what are now called Turing machines he provided the modern approach to incompleteness and undecidability) to specific issues of practical design; he also contributed to mathematical biology (morphology) and much else. At the same time, he played a key role in the British government&#8217;s breaking <\/p>\n<p>Continue reading <a href=\"https:\/\/experimentalmath.info\/blog\/2012\/04\/will-computers-soon-pass-the-turing-test\/\">Is your mate actually a computer?   Would you pass the &#8220;Turing test&#8221;?<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[],"class_list":["post-2547","post","type-post","status-publish","format-standard","hentry","category-essays","odd"],"_links":{"self":[{"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/posts\/2547","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/comments?post=2547"}],"version-history":[{"count":120,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/posts\/2547\/revisions"}],"predecessor-version":[{"id":3266,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/posts\/2547\/revisions\/3266"}],"wp:attachment":[{"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/media?parent=2547"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/categories?post=2547"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/experimentalmath.info\/blog\/wp-json\/wp\/v2\/tags?post=2547"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}