Computing Machinery and Intelligence

<h2 id="turings-test">Turing's test</h2>

Main article: <a href="/facts/Turing_test/wEvf9DIr">Turing test</a> 
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="/facts/Turing_test/wEvf9DIr">Imitation Game</a>". 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.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>
Turing proposes a variation of this game that involves the computer:<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a>

<blockquote>We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?"</blockquote>
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.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>
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="/facts/Artificial_intelligence/lJGauQwX">AI</a>) research in 1956.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> It was a common topic among the members of the <a href="/facts/Ratio_Club/QKhI407Q">Ratio Club</a>, an informal group of British <a href="/facts/Cybernetics/4qb58zbt">cybernetics</a> and <a href="/facts/Electronics/E4JhgISq">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.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>
As <a href="/facts/Stevan_Harnad/K7vY3yTK">Stevan Harnad</a> notes,<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a> 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 act indistinguishably<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> 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.
Since Turing introduced his test, it has been both highly influential and widely criticised, and has become an important concept in the <a href="/facts/Philosophy_of_artificial_intelligence/wlxbtGjL">philosophy of artificial intelligence</a>.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a><a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> Some of its criticisms, such as <a href="/facts/John_Searle/YDMljSH7">John Searle</a>'s <a href="/facts/Chinese_room/YeKegsxS">Chinese room</a>, are themselves controversial.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a><a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> Some have taken Turing's question to have been "Can a computer, communicating over a teleprinter, fool a person into believing it is human?"<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> but it seems clear that Turing was not talking about fooling people but about generating human cognitive capacity.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a>

<h2 id="digital-machines">Digital machines</h2>
See also: <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a> and <a href="/facts/Church%25E2%2580%2593Turing_thesis/hDHn641f">Church–Turing thesis</a>
Turing also notes that we need to determine which "machines" we wish to consider. He points out that a human <a href="/facts/Cloning/Vb6SM4c7">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.
First, there is no reason to speculate whether or not they can exist. They already did in 1950.
Second, digital machinery is "universal". Turing's research into the <a href="/facts/Theory_of_computation/xYJd2YeI">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="/facts/Church%25E2%2580%2593Turing_thesis/hDHn641f">Church–Turing thesis</a> and the <a href="/facts/Universal_Turing_machine/2klpb1qQ">universal Turing machine</a>.) Therefore, if any digital machine can "act like it is thinking", then every sufficiently powerful digital machine can. Turing writes, "all digital computers are in a sense equivalent."<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a>
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?"<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a>
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".<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a> 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.

<h2 id="nine-common-objections">Nine common objections</h2>
See also: <a href="/facts/Philosophy_of_artificial_intelligence/wlxbtGjL">Philosophy of artificial intelligence</a>
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.<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>

<ol><li><a href="/facts/Religious/cxntrD0R">Religious</a> Objection: This states that thinking is a function of man's <a href="/facts/Immortality/nDAb6CKo">immortal</a> <a href="/facts/Soul/DJl01SxP">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> 'Heads in the Sand' Objection: "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="/facts/Existential_risk_from_artificial_general_intelligence/j7oxWDYY">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="/facts/Appeal_to_consequences/laP93LVK">appeal to consequences</a>, confusing what should not be with what can or cannot be (Wardrip-Fruin, 56).</li>
<li>The <a href="/facts/Mathematics/pxTouaz4">Mathematical</a> Objection: This objection uses mathematical theorems, such as <a href="/facts/G%25C3%25B6del%2527s_incompleteness_theorem/du8PRu8g">Gödel's incompleteness theorem</a>, to show that there are limits to what questions a computer system based on <a href="/facts/Logic/8JnpJLtt">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="/facts/John_Lucas_(philosopher)/05eF8Gxj">John Lucas</a> in 1961 and <a href="/facts/Physicist/cQcgvSIm">physicist</a> <a href="/facts/Roger_Penrose/r4mlrFUH">Roger Penrose</a> in 1989, and later would be called <a href="/facts/Penrose%25E2%2580%2593Lucas_argument/Ap05EwRw">Penrose–Lucas argument</a>.)<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a></li>
<li>Argument From <a href="/facts/Consciousness/IAxmgt6c">Consciousness</a>: This argument, suggested by Professor <a href="/facts/Geoffrey_Jefferson/H8Ir2CIt">Geoffrey Jefferson</a> in his 1949 <a href="/facts/Lister_Medal/APcPDBoc">Lister Oration</a> (acceptance speech for his 1948 award of Lister Medal<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a>) 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."<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> 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 conscious experiences or understanding, would be made in 1980 by philosopher <a href="/facts/John_Searle/YDMljSH7">John Searle</a> in his <a href="/facts/Chinese_room/YeKegsxS">Chinese room</a> argument. Turing's reply is now known as the "<a href="/facts/Problem_of_other_minds/em1nN1jc">other minds</a> reply". See also <a href="/facts/Philosophy_of_artificial_intelligence%23Can_a_machine_have_a_mind%2c_consciousness_and_mental_states%3f/wlxbtGjL">Can a machine have a mind?</a> in the <a href="/facts/Philosophy_of_AI/wlxbtGjL">philosophy of AI</a>.)<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a></li>
<li>Arguments from various disabilities. These arguments all have the form "a computer will never do X". Turing offers a selection:<blockquote>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.</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>Machines cannot make mistakes. He notes it's easy to program a machine to appear to make a mistake.</li>
<li>A machine cannot be the subject of its own thought (or can't be <a href="/facts/Self-aware/e3Wh7bFx">self-aware</a>). A program which can report on its internal states and processes, in the simple sense of a <a href="/facts/Debugger/mCe6UsWj">debugger</a> program, can certainly be written. Turing asserts "a machine can undoubtably be its own subject matter."</li>
<li>A machine cannot have much diversity of behaviour. He notes that, with enough storage capacity, a computer can behave in an astronomical number of different ways.</li></ol></li>
<li><a href="/facts/Ada_Lovelace/s3c2GGRu">Lady Lovelace</a>'s Objection: One of the most famous objections states that computers are incapable of originality. This is largely because, according to <a href="/facts/Ada_Lovelace/s3c2GGRu">Ada Lovelace</a>, machines are incapable of independent learning.<blockquote>The Analytical Engine has no pretensions whatever to originate anything. It can do whatever we know how to order it to perform. It can follow analysis; but it has no power of anticipating any analytical relations or truths.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a></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>Argument from continuity in the nervous system: Modern <a href="/facts/Neurological/TXYEMSYI">neurological</a> research has shown that the brain is not digital. Even though <a href="/facts/Neuron/G7CyTVdH">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="/facts/Philosopher/Hyvzc54m">Philosopher</a> <a href="/facts/Hubert_Dreyfus/EkD4QzkL">Hubert Dreyfus</a> would make this argument against "the biological assumption" in 1972.)<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a></li>
<li>Argument from the informality of behaviour: 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="/facts/Hubert_Dreyfus/EkD4QzkL">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="/facts/Robotics/wkmvodJz">robotics</a> and <a href="/facts/Computational_intelligence/GXpXlhu3">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="/facts/Dreyfus%2527_critique_of_AI/QhqGjuGV">Dreyfus' critique of AI</a>).<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a> This rejoinder also includes the <a href="/facts/Turing%2527s_Wager/j8TY4gmy">Turing's Wager</a> argument.</li>
<li><a href="/facts/Extra-sensory_perception/nT29VWIA">Extra-sensory perception</a>: 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="/facts/Telepathy/nrQsUUJQ">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="/facts/Samuel_Soal/81t7Ho4X">Samuel Soal</a>, a member of the <a href="/facts/Society_for_Psychical_Research/qIKAxANh">Society for Psychical Research</a>.<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a></li></ol>
<h2 id="learning-machines">Learning machines</h2>
See also: <a href="/facts/Machine_learning/e0w0XJTu">Machine learning</a>
In the final section of the paper Turing details his thoughts about the Learning Machine that could play the imitation game successfully.
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="/facts/Neutron/oRCM1geb">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="/facts/Critical_mass/wRAnE21M">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.
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:

1. The initial state of the mind, say at birth,
2. The education to which it has been subjected,
3. Other experience, not to be described as education, to which it has been subjected.
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:

Structure of the child machine = hereditary material
Changes of the child machine = mutations
Natural selection = judgment of the experimenter
Following this discussion Turing addresses certain specific aspects of the learning machine: 

<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="/facts/Proposition/0877MFMD">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>
<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>
<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>
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.".
An examination of the development in <a href="/facts/Artificial_intelligence/lJGauQwX">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="/facts/Deep_Blue_(chess_computer)/7lnCRVup">Deep Blue</a>, a chess playing computer developed by <a href="/facts/IBM/QszA7nwd">IBM</a> and one which defeated the world champion <a href="/facts/Garry_Kasparov/NNjULdHH">Garry Kasparov</a> (though, this too is controversial) and the numerous computer chess games which can outplay most amateurs.<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a> As for the second suggestion Turing makes, it has been likened by some authors as a call to finding a <a href="/facts/Simulacrum/0JfnTh8m">simulacrum</a> of human cognitive development.<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a> Such attempts at finding the underlying algorithms by which children learn the features of the world around them are only beginning to be made.<a class="footnote-ref" id="fnref:29" href="#fn:29">29</a><a class="footnote-ref" id="fnref:30" href="#fn:30">30</a><a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>

<h2 id="notes">Notes</h2>

<ul><li><a href="/facts/Rodney_Brooks/JcAvm7Wp">Brooks, Rodney</a> (1990), <a href="http://people.csail.mit.edu/brooks/papers/elephants.pdf">"Elephants Don't Play Chess"</a> (PDF), Robotics and Autonomous Systems, 6 (1–2): 3–15, <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.7539">10.1.1.588.7539</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2FS0921-8890%2805%2980025-9">10.1016/S0921-8890(05)80025-9</a>, retrieved 30 August 2007</li>
<li><a href="/facts/Daniel_Crevier/YswWUQ86">Crevier, Daniel</a> (1993). AI: The Tumultuous Search for Artificial Intelligence. New York, NY: BasicBooks. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-465-02997-3.</li>
<li><a href="/facts/Hubert_Dreyfus/EkD4QzkL">Dreyfus, Hubert</a> (1972), <a href="/facts/What_Computers_Can%2527t_Do/QhqGjuGV">What Computers Can't Do</a>, New York: MIT Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-06-011082-6</li>
<li><a href="/facts/Hubert_Dreyfus/EkD4QzkL">Dreyfus, Hubert</a>; Dreyfus, Stuart (1986), Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer, Oxford, UK: Blackwell</li>
<li><a href="/facts/Hubert_Dreyfus/EkD4QzkL">Dreyfus, Hubert</a> (1979), What Computers Still Can't Do, New York: MIT Press.</li>
<li><a href="/facts/Stevan_Harnad/K7vY3yTK">Harnad, Stevan</a>; Scherzer, Peter (2008), <a 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>, Artificial Intelligence in Medicine, 44 (2): 83–9, <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.4269">10.1.1.115.4269</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2Fj.artmed.2008.08.008">10.1016/j.artmed.2008.08.008</a>, <a href="/facts/PMID_(identifier)/JlHAvMHt">PMID</a> <a href="https://pubmed.ncbi.nlm.nih.gov/18930641">18930641</a>, archived from <a href="http://eprints.ecs.soton.ac.uk/14430/">the original</a> on 8 February 2012, retrieved 29 August 2010.</li>
<li><a href="/facts/John_Haugeland/xN5tfAzY">Haugeland, John</a> (1985), Artificial Intelligence: The Very Idea, Cambridge, Mass.: MIT Press.</li>
<li><a href="/facts/Hans_Moravec/1u3e4lNo">Moravec, Hans</a> (1976), <a href="https://web.archive.org/web/20160303232511/http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html">The Role of Raw Power in Intelligence</a>, archived from <a href="http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html">the original</a> on 3 March 2016, retrieved 7 November 2007</li>
<li><a href="/facts/Douglas_Hofstadter/LxUaf01J">Hofstadter, Douglas</a> (1979), <a href="/facts/G%25C3%25B6del%2c_Escher%2c_Bach/5VCxjXvk">Gödel, Escher, Bach: an Eternal Golden Braid</a>.</li>
<li><a href="/facts/John_Lucas_(philosopher)/05eF8Gxj">Lucas, John</a> (1961), "Minds, Machines and Gödel", in Anderson, A.R. (ed.), <a href="https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html">Minds and Machines</a>, archived from <a href="http://users.ox.ac.uk/~jrlucas/Godel/mmg.html">the original</a> on 19 August 2007, retrieved 2 December 2022</li>
<li><a href="/facts/Hans_Moravec/1u3e4lNo">Moravec, Hans</a> (1988), Mind Children, Harvard University Press</li>
<li><a href="/facts/Roger_Penrose/r4mlrFUH">Penrose, Roger</a> (1989), <a href="/facts/The_Emperor%2527s_New_Mind/eYAE87Yl">The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics</a>, Oxford University Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-14-014534-2</li>
<li><a href="/facts/Stuart_J._Russell/f6EbRvSV">Russell, Stuart J.</a>; <a href="/facts/Peter_Norvig/GkCUHH4H">Norvig, Peter</a> (2003), <a href="http://aima.cs.berkeley.edu/">Artificial Intelligence: A Modern Approach</a> (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-13-790395-2</li>
<li><a href="/facts/John_Searle/YDMljSH7">Searle, John</a> (1980), <a href="https://home.csulb.edu/~cwallis/382/readings/482/searle.minds.brains.programs.bbs.1980.pdf">"Minds, Brains and Programs"</a> (PDF), Behavioral and Brain Sciences, 3 (3): 417–457, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1017%2FS0140525X00005756">10.1017/S0140525X00005756</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:55303721">55303721</a></li>
<li><a href="/facts/Alan_Turing/klov9b6g">Turing, Alan</a> (October 1950), <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf">"Computing Machinery and Intelligence"</a> (PDF), Mind, LIX (236): 433–460, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1093%2Fmind%2FLIX.236.433">10.1093/mind/LIX.236.433</a></li>
<li>Saygin, A. P. (2000). "Turing Test: 50 years later". Minds and Machines. 10 (4): 463–518. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1023%2FA%3A1011288000451">10.1023/A:1011288000451</a>. <a href="/facts/Hdl_(identifier)/rdebSxmC">hdl</a>:<a href="https://hdl.handle.net/11693%2F24987">11693/24987</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:990084">990084</a>.</li>
<li><a href="/facts/Noah_Wardrip-Fruin/pwgSyLf0">Noah Wardrip-Fruin</a> and Nick Montfort, eds. (2003). The New Media Reader. Cambridge: MIT Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-262-23227-8. "Lucasfilm's Habitat" pp. 663–677.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a 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>Saygin, Ayse Pinar; Cicekli, Ilyas; Akman, Varol (1999). "An analysis and review of the next 50 years". Minds and Machines: 2000. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.1592">10.1.1.157.1592</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Turing 1950, p. 433 - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Oppy, Graham; Dowe, David (2021), "The Turing Test", in Zalta, Edward N. (ed.), The Stanford Encyclopedia of Philosophy (Winter 2021 ed.), Metaphysics Research Lab, Stanford University, retrieved 6 August 2023[permanent dead link] <a href="https://plato.stanford.edu/archives/win2021/entriesuring-test/" target="_blank">https://plato.stanford.edu/archives/win2021/entriesuring-test/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Turing 1950, p. 434 - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">This describes the simplest version of the test. For a more detailed discussion, see Versions of the Turing test. <a href="/wiki/Turing_test#Versions" target="_blank">/wiki/Turing_test#Versions</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">The Dartmouth workshop of 1956 is widely considered the "birth of AI". (Crevier 1993, p. 49) <a href="/wiki/Dartmouth_workshop" target="_blank">/wiki/Dartmouth_workshop</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">"Intelligent Machinery" (1948) was not published by Turing, and did not see publication until 1968 in:

Evans, A. D. J.; Robertson (1968), Cybernetics: Key Papers, University Park Press
 <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Harnad, Stevan (2008), "The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence", in Epstein, Robert; Peters, Grace (eds.), The Turing Test Sourcebook: Philosophical and Methodological Issues in the Quest for the Thinking Computer, Kluwer <a href="http://eprints.ecs.soton.ac.uk/12954/" target="_blank">http://eprints.ecs.soton.ac.uk/12954/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Harnad, Stevan (2001), "Minds, Machines, and Turing: The Indistinguishability of Indistinguishables", Journal of Logic, Language and Information, 9 (4): 425–445, doi:10.1023/A:1008315308862, S2CID 1911720. <a href="http://cogprints.org/2615/" target="_blank">http://cogprints.org/2615/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Swiechowski, Maciej (2020). "Game AI Competitions: Motivation for the Imitation Game-Playing Competition" (PDF). Proceedings of the 2020 Federated Conference on Computer Science and Information Systems. IEEE Publishing. pp. 155–160. doi:10.15439/2020F126. ISBN 978-83-955416-7-4. S2CID 222296354. Archived (PDF) from the original on 26 January 2021. Retrieved 8 September 2020. <a href="978-83-955416-7-4" target="_blank">978-83-955416-7-4</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Withers, Steven (11 December 2007), "Flirty Bot Passes for Human", iTWire, archived from the original on 4 October 2017, retrieved 10 February 2010 <a href="http://www.itwire.com/your-it-news/home-it/15748-flirty-bot-passes-for-human" target="_blank">http://www.itwire.com/your-it-news/home-it/15748-flirty-bot-passes-for-human</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Williams, Ian (10 December 2007), "Online Love Seerkers Warned Flirt Bots", V3, archived from the original on 24 April 2010, retrieved 10 February 2010 <a href="http://www.v3.co.uk/vnunet/news/2205441/online-love-seekers-warned-flirt-bots" target="_blank">http://www.v3.co.uk/vnunet/news/2205441/online-love-seekers-warned-flirt-bots</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Jeremy Kahn (13 June 2022). "A.I. experts say the Google researcher's claim that his chatbot became 'sentient' is ridiculous—but also highlights big problems in the field". Fortune. Archived from the original on 13 June 2022. Retrieved 13 June 2022. <a href="https://fortune.com/2022/06/13/google-ai-researchers-sentient-chatbot-claims-ridiculed-by-experts/" target="_blank">https://fortune.com/2022/06/13/google-ai-researchers-sentient-chatbot-claims-ridiculed-by-experts/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Wardrip-Fruin, Noah and Nick Montfort, ed (2003). The New Media Reader. The MIT Press. ISBN 0-262-23227-8. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Harnad, Stevan (1992), "The Turing Test Is Not A Trick: Turing Indistinguishability Is A Scientific Criterion", ACM SIGART Bulletin, 3 (4): 9–10, doi:10.1145/141420.141422, S2CID 36356326. <a href="http://cogprints.org/1584/" target="_blank">http://cogprints.org/1584/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Turing 1950, p. 442 - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Turing 1950, p. 442 - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Turing 1950, p. 436 - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Turing 1950 see Russell & Norvig 2003, 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." - Turing, Alan (October 1950), "Computing Machinery and Intelligence" (PDF), Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433 <a href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" target="_blank">https://www.csee.umbc.edu/courses/471/papers/turing.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Lucas 1961, Penrose 1989, Hofstadter 1979, pp. 471–473, 476–477 and Russell & Norvig 2003, pp. 949–950. Russell and Norvig identify Lucas and Penrose's arguments as being the same one answered by Turing. - Lucas, John (1961), "Minds, Machines and Gödel", in Anderson, A.R. (ed.), Minds and Machines, archived from the original on 19 August 2007, retrieved 2 December 2022 <a href="https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html" target="_blank">https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">"Announcements". Nature. 162 (4108): 138. 1948. Bibcode:1948Natur.162U.138.. doi:10.1038/162138e0. <a href="https://doi.org/10.1038%2F162138e0" target="_blank">https://doi.org/10.1038%2F162138e0</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Jefferson, Geoffrey (25 June 1949). "The Mind of Mechanical Man". British Medical Journal. 1 (4616): 1105–1110. doi:10.1136/bmj.1.4616.1105. ISSN 0007-1447. PMC 2050428. PMID 18153422. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2050428" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2050428</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Searle 1980 and Russell & Norvig 2003, pp. 958–960, who identify Searle's argument with the one Turing answers. - Searle, John (1980), "Minds, Brains and Programs" (PDF), Behavioral and Brain Sciences, 3 (3): 417–457, doi:10.1017/S0140525X00005756, S2CID 55303721 <a href="https://home.csulb.edu/~cwallis/382/readings/482/searle.minds.brains.programs.bbs.1980.pdf" target="_blank">https://home.csulb.edu/~cwallis/382/readings/482/searle.minds.brains.programs.bbs.1980.pdf</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">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 href="https://en.wikisource.org/wiki/Scientific_Memoirs/3/Sketch_of_the_Analytical_Engine_invented_by_Charles_Babbage,_Esq./Notes_by_the_Translator" target="_blank">https://en.wikisource.org/wiki/Scientific_Memoirs/3/Sketch_of_the_Analytical_Engine_invented_by_Charles_Babbage,_Esq./Notes_by_the_Translator</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Dreyfus 1979, p. 156 - Dreyfus, Hubert (1979), What Computers Still Can't Do, New York: MIT Press <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Dreyfus 1972, Dreyfus & Dreyfus 1986, Moravec 1988 and Russell & Norvig 2003, pp. 51–52, who identify Dreyfus' argument with the one Turing answers. - Dreyfus, Hubert (1972), What Computers Can't Do, New York: MIT Press, ISBN 978-0-06-011082-6 <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Leavitt, David (26 January 2017), "Turing and the paranormal", The Turing Guide, Oxford University Press, doi:10.1093/oso/9780198747826.003.0042, ISBN 978-0-19-874782-6, retrieved 23 July 2023 <a href="978-0-19-874782-6" target="_blank">978-0-19-874782-6</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">Epstein, Robert; Roberts, Gary; Beber, Grace (2008). Parsing the Turing Test:Philosophical and Methodological Issues in the Quest for the Thinking Computer. Springer. p. 65. ISBN 978-1-4020-6710-5. <a href="978-1-4020-6710-5" target="_blank">978-1-4020-6710-5</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Epstein, Robert; Roberts, Gary; Beber, Grace (2008). Parsing the Turing Test:Philosophical and Methodological Issues in the Quest for the Thinking Computer. Springer. p. 65. ISBN 978-1-4020-6710-5. <a href="978-1-4020-6710-5" target="_blank">978-1-4020-6710-5</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Epstein, Robert; Roberts, Gary; Beber, Grace (2008). Parsing the Turing Test:Philosophical and Methodological Issues in the Quest for the Thinking Computer. Springer. p. 65. ISBN 978-1-4020-6710-5. <a href="978-1-4020-6710-5" target="_blank">978-1-4020-6710-5</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">Gopnik, Alison; Meltzoff, Andrew N. (1997). Words, thoughts, and theories. Learning, Development, and Conceptual Change. MIT Press. ISBN 9780262071758. <a href="9780262071758" target="_blank">9780262071758</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">Meltzoff, Andrew N. (1999). "Origins of theory of mind, cognition and communication" (PDF). Journal of Communication Disorders. 32 (4): 251–269. doi:10.1016/S0021-9924(99)00009-X. PMC 3629913. PMID 10466097. Archived from the original (PDF) on 15 April 2021. Retrieved 27 November 2014. <a href="https://web.archive.org/web/20210415081358/http://ilabs.washington.edu/meltzoff/pdf/99Meltzoff_JCommDisord.pdf" target="_blank">https://web.archive.org/web/20210415081358/http://ilabs.washington.edu/meltzoff/pdf/99Meltzoff_JCommDisord.pdf</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
</ol>

Computing Machinery and Intelligence open-in-new

Computing Machinery and Intelligence