1950, Alan Turing, Computing Machinery and Intelligence

<p>"<strong>Computing Machinery and Intelligence</strong>" is a seminal paper written by <a title="Alan Turing" href="https://en.m.wikipedia.org/wiki/Alan_Turing">Alan Turing</a> on the topic of <a title="Artificial intelligence" href="https://en.m.wikipedia.org/wiki/Artificial_intelligence">artificial intelligence</a>. The paper, published in 1950 in <em><a title="Mind (journal)" href="https://en.m.wikipedia.org/wiki/Mind_(journal)">Mind</a></em>, was the first to introduce his concept of what is now known as the <a title="Turing test" href="https://en.m.wikipedia.org/wiki/Turing_test">Turing test</a> to the general public.</p>

<p>Turing's paper considers the question "Can machines think?" Since the words "think" and "machine" cannot be defined in a clear way that satisfies everyone, Turing suggests we "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="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-1">[1]</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>

<h2>Contents</h2>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="Turing.27s_test"></span><span id="Turing's_test" class="mw-headline">Turing's test</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: Turing's test" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=1" data-section="1">Edit</a></span></h2>

<div class="thumbcaption">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</div>

</div>

<div class="hatnote navigation-not-searchable">Main article: <a title="Turing test" href="https://en.m.wikipedia.org/wiki/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 title="Turing test" href="https://en.m.wikipedia.org/wiki/Turing_test#Imitation_Game">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.</p>

<p>Turing proposes a variation of this game that involves the computer: '"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?"'<sup id="cite_ref-2" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-2">[2]</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-3" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-3">[3]</a></sup></p>

<p>As <a title="Stevan Harnad" href="https://en.m.wikipedia.org/wiki/Stevan_Harnad">Stevan Harnad</a> notes,<sup id="cite_ref-4" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-4">[4]</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 <em>act</em> indistinguishably<sup id="cite_ref-5" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-5">[5]</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>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_6-0" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-NMR-6">[6]</a></sup> but it seems clear that Turing was not talking about fooling people but about generating human cognitive capacity.<sup id="cite_ref-7" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-7">[7]</a></sup></p>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="Digital_machines" class="mw-headline">Digital machines</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: Digital machines" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=2" data-section="2">Edit</a></span></h2>

<div class="hatnote navigation-not-searchable">See also: <a title="Turing machine" href="https://en.m.wikipedia.org/wiki/Turing_machine">Turing machine</a> and <a title="Church–Turing thesis" href="https://en.m.wikipedia.org/wiki/Church%E2%80%93Turing_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 title="Cloning" href="https://en.m.wikipedia.org/wiki/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 title="Theory of computation" href="https://en.m.wikipedia.org/wiki/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 title="Church–Turing thesis" href="https://en.m.wikipedia.org/wiki/Church%E2%80%93Turing_thesis">Church–Turing thesis</a> and the <a title="Universal Turing machine" href="https://en.m.wikipedia.org/wiki/Universal_Turing_machine">universal Turing machine</a>.) Therefore, if <em>any</em> digital machine can "act like it is thinking" then, <em>every</em> sufficiently powerful digital machine can. Turing writes, "all digital computers are in a sense equivalent."<sup id="cite_ref-P442_8-0" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-P442-8">[8]</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_8-1" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-P442-8">[8]</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_9-0" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-P436-9">[9]</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>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="Nine_common_objections" class="mw-headline">Nine common objections</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: Nine common objections" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=3" data-section="3">Edit</a></span></h2>

<div class="hatnote navigation-not-searchable">See also: <a title="Philosophy of artificial intelligence" href="https://en.m.wikipedia.org/wiki/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-10" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-10">[10]</a></sup></p>

<ol>

<li><em><a class="mw-redirect" title="Religious" href="https://en.m.wikipedia.org/wiki/Religious">Religious</a> Objection</em>: This states that thinking is a function of man's <a title="Immortality" href="https://en.m.wikipedia.org/wiki/Immortality">immortal</a> <a title="Soul" href="https://en.m.wikipedia.org/wiki/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><em>'Heads in the Sand' Objection</em>: "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 title="Existential risk from artificial general intelligence" href="https://en.m.wikipedia.org/wiki/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 title="Appeal to consequences" href="https://en.m.wikipedia.org/wiki/Appeal_to_consequences">appeal to consequences</a>, confusing what should not be with what can or cannot be (Wardrip-Fruin, 56).</li>

<li><em><a title="Mathematics" href="https://en.m.wikipedia.org/wiki/Mathematics">Mathematical</a> Objections</em>: This objection uses mathematical theorems, such as <a class="mw-redirect" title="Gödel's incompleteness theorem" href="https://en.m.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorem">Gödel's incompleteness theorem</a>, to show that there are limits to what questions a computer system based on <a title="Logic" href="https://en.m.wikipedia.org/wiki/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 title="John Lucas (philosopher)" href="https://en.m.wikipedia.org/wiki/John_Lucas_(philosopher)">John Lucas</a> in 1961 and <a title="Physicist" href="https://en.m.wikipedia.org/wiki/Physicist">physicist</a> <a title="Roger Penrose" href="https://en.m.wikipedia.org/wiki/Roger_Penrose">Roger Penrose</a> in 1989.)<sup id="cite_ref-11" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-11">[11]</a></sup></li>

<li><em>Argument From <a title="Consciousness" href="https://en.m.wikipedia.org/wiki/Consciousness">Consciousness</a></em>: This argument, suggested by Professor <a title="Geoffrey Jefferson" href="https://en.m.wikipedia.org/wiki/Geoffrey_Jefferson">Geoffrey Jefferson</a> in his 1949 Lister Oration 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-12" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-12">[12]</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 <em>conscious experiences</em> or <em>understanding</em>, would be made in 1980 by philosopher <a title="John Searle" href="https://en.m.wikipedia.org/wiki/John_Searle">John Searle</a> in his <a title="Chinese room" href="https://en.m.wikipedia.org/wiki/Chinese_room">Chinese room</a> argument. Turing's reply is now known as the "<a title="Problem of other minds" href="https://en.m.wikipedia.org/wiki/Problem_of_other_minds">other minds</a> reply". See also <a title="Philosophy of artificial intelligence" href="https://en.m.wikipedia.org/wiki/Philosophy_of_artificial_intelligence#Can_a_machine_have_a_mind,_consciousness_and_mental_states?">Can a machine have a mind?</a> in the <a class="mw-redirect" title="Philosophy of AI" href="https://en.m.wikipedia.org/wiki/Philosophy_of_AI">philosophy of AI</a>.)<sup id="cite_ref-13" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-13">[13]</a></sup></li>

<li><em>Arguments from various disabilities</em>. These arguments all have the form "a computer will never do <em>X</em>". Turing offers a selection:

<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><em>Machines cannot make mistakes.</em> He notes it's easy to program a machine to appear to make a mistake.</li>

<li><em>A machine cannot be the subject of its own thought</em> (or can't be <a class="mw-redirect" title="Self-aware" href="https://en.m.wikipedia.org/wiki/Self-aware">self-aware</a>). A program which can report on its internal states and processes, in the simple sense of a <a title="Debugger" href="https://en.m.wikipedia.org/wiki/Debugger">debugger</a> program, can certainly be written. Turing asserts "a machine can undoubtably be its own subject matter."</li>

<li><em>A machine cannot have much diversity of behaviour.</em> He notes that, with enough storage capacity, a computer can behave in an astronomical number of different ways.</li>

</ol>

</li>

<li><em><a title="Ada Lovelace" href="https://en.m.wikipedia.org/wiki/Ada_Lovelace">Lady Lovelace</a>'s Objection</em>: One of the most famous objections states that computers are incapable of originality. This is largely because, according to <a title="Ada Lovelace" href="https://en.m.wikipedia.org/wiki/Ada_Lovelace">Ada Lovelace</a>, machines are incapable of independent learning.

<p>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.</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><em>Argument from continuity in the nervous system</em>: Modern <a class="mw-redirect" title="Neurological" href="https://en.m.wikipedia.org/wiki/Neurological">neurological</a> research has shown that the brain is not digital. Even though <a title="Neuron" href="https://en.m.wikipedia.org/wiki/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 title="Philosopher" href="https://en.m.wikipedia.org/wiki/Philosopher">Philosopher</a> <a title="Hubert Dreyfus" href="https://en.m.wikipedia.org/wiki/Hubert_Dreyfus">Hubert Dreyfus</a> would make this argument against "the biological assumption" in 1972.)<sup id="cite_ref-14" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-14">[14]</a></sup></li>

<li><em>Argument from the informality of behaviour</em>: 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 title="Hubert Dreyfus" href="https://en.m.wikipedia.org/wiki/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 title="Robotics" href="https://en.m.wikipedia.org/wiki/Robotics">robotics</a> and <a title="Computational intelligence" href="https://en.m.wikipedia.org/wiki/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 class="mw-redirect" title="Dreyfus' critique of AI" href="https://en.m.wikipedia.org/wiki/Dreyfus%27_critique_of_AI">Dreyfus' critique of AI</a>).<sup id="cite_ref-15" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-15">[15]</a></sup> This rejoinder also includes the <a title="Turing's Wager" href="https://en.m.wikipedia.org/wiki/Turing%27s_Wager">Turing's Wager</a> argument.</li>

<li><em><a class="mw-redirect" title="Extra-sensory perception" href="https://en.m.wikipedia.org/wiki/Extra-sensory_perception">Extra-sensory perception</a></em>: 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 title="Telepathy" href="https://en.m.wikipedia.org/wiki/Telepathy">mind-reading</a> would not affect the test.</li>

</ol>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="Learning_machines" class="mw-headline">Learning machines</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: Learning machines" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=4" data-section="4">Edit</a></span></h2>

<div class="hatnote navigation-not-searchable">See also: <a title="Machine learning" href="https://en.m.wikipedia.org/wiki/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 title="Neutron" href="https://en.m.wikipedia.org/wiki/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 title="Critical mass" href="https://en.m.wikipedia.org/wiki/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 adults 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 materialChanges</dd>

<dd>of the child machine = mutationsNatural</dd>

<dd>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 title="Proposition" href="https://en.m.wikipedia.org/wiki/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 a 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 title="Artificial intelligence" href="https://en.m.wikipedia.org/wiki/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 title="Deep Blue (chess computer)" href="https://en.m.wikipedia.org/wiki/Deep_Blue_(chess_computer)">Deep Blue</a>, a chess playing computer developed by <a title="IBM" href="https://en.m.wikipedia.org/wiki/IBM">IBM</a> and one which defeated the world champion <a title="Garry Kasparov" href="https://en.m.wikipedia.org/wiki/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_16-0" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-ParsingTT2008-16">[16]</a></sup> As for the second suggestion Turing makes, it has been likened by some authors as a call to finding a <a title="Simulacrum" href="https://en.m.wikipedia.org/wiki/Simulacrum">simulacrum</a> of human cognitive development.<sup id="cite_ref-ParsingTT2008_16-1" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-ParsingTT2008-16">[16]</a></sup> And such attempts at finding the underlying algorithms by which children learn of the features of the world around them are only beginning to be made.<sup id="cite_ref-ParsingTT2008_16-2" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-ParsingTT2008-16">[16]</a></sup><sup id="cite_ref-17" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-17">[17]</a></sup><sup id="cite_ref-18" class="reference"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_note-18">[18]</a></sup></p>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="Notes" class="mw-headline">Notes</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: Notes" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=5" data-section="5">Edit</a></span></h2>

<li id="cite_note-1"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-1">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFTuring1950">Turing 1950</a>, p. 433</span></li>

<li id="cite_note-2"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-2">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFTuring1950">Turing 1950</a>, p. 434</span></li>

<li id="cite_note-3"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-3">^{</a></strong></span> }<span class="reference-text">This describes the simplest version of the test. For a more detailed discussion, see <a title="Turing test" href="https://en.m.wikipedia.org/wiki/Turing_test#Versions">Versions of the Turing test</a>.</span></li>

<li id="cite_note-4"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-4">^{</a></strong></span> }<span class="reference-text"><cite id="CITEREFHarnad2008" class="citation">Harnad, Stevan (2008), <a class="external text" href="http://eprints.ecs.soton.ac.uk/12954/" rel="nofollow">"The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence"</a>, in Epstein, Robert; Peters, Grace (eds.), <em>The Turing Test Sourcebook: Philosophical and Methodological Issues in the Quest for the Thinking Computer</em>, Kluwer</cite></span></li>

<li id="cite_note-5"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-5">^{</a></strong></span> }<span class="reference-text"><cite id="CITEREFHarnad2001" class="citation">Harnad, Stevan (2001), <a class="external text" href="http://cogprints.org/2615/" rel="nofollow">"Minds, Machines, and Turing: The Indistinguishability of Indistinguishables"</a>, <em>Journal of Logic, Language and Information</em>, <strong>9</strong> (4): 425–445, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1023%2FA%3A1008315308862" rel="nofollow">10.1023/A:1008315308862</a>.</cite></span></li>

<li id="cite_note-NMR-6"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-NMR_6-0">^{</a></strong></span> }<span class="reference-text">Wardrip-Fruin, Noah and Nick Montfort, ed (2003). The New Media Reader. The MIT Press. <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/0-262-23227-8" href="https://en.m.wikipedia.org/wiki/Special:BookSources/0-262-23227-8">0-262-23227-8</a>.</span></li>

<li id="cite_note-7"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-7">^{</a></strong></span> }<span class="reference-text"><cite id="CITEREFHarnad1992" class="citation">Harnad, Stevan (1992), <a class="external text" href="http://cogprints.org/1584/" rel="nofollow">"The Turing Test Is Not A Trick: Turing Indistinguishability Is A Scientific Criterion"</a>, <em>SIGART Bulletin</em>, <strong>3</strong>(4): 9–10, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1145%2F141420.141422" rel="nofollow">10.1145/141420.141422</a>.</cite></span></li>

<li id="cite_note-P442-8"><span class="mw-cite-backlink">^ <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-P442_8-0"><sup><em><strong>a</strong></em></sup></a> <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-P442_8-1"><sup><em><strong>b</strong></em></sup></a></span> <span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFTuring1950">Turing 1950</a>, p. 442</span></li>

<li id="cite_note-P436-9"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-P436_9-0">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFTuring1950">Turing 1950</a>, p. 436</span></li>

<li id="cite_note-10"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-10">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFTuring1950">Turing 1950</a> and see <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#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-11"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-11">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFLucas1961">Lucas 1961</a>, <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFPenrose1989">Penrose 1989</a>, <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFHofstadter1979">Hofstadter 1979</a>, pp. 471–473,476–477 and <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#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-12"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-12">^{</a></strong></span> }<span class="reference-text"><a class="external text" href="http://www.turingarchive.org/browse.php/B/44" rel="nofollow">"The Mind of Mechanical Man"</a></span></li>

<li id="cite_note-13"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-13">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFSearle1980">Searle 1980</a> and <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 958–960, who identify Searle's argument with the one Turing answers.</span></li>

<li id="cite_note-14"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-14">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFDreyfus1979">Dreyfus 1979</a>, p. 156</span></li>

<li id="cite_note-15"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-15">^{</a></strong></span> }<span class="reference-text"><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFDreyfus1972">Dreyfus 1972</a>, <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFDreyfusDreyfus1986">Dreyfus & Dreyfus 1986</a>, <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFMoravec1988">Moravec 1988</a> and <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#CITEREFRussellNorvig2003">Russell & Norvig 2003</a>, pp. 51–52, who identify Dreyfus' argument with the one Turing answers.</span></li>

<li id="cite_note-ParsingTT2008-16"><span class="mw-cite-backlink">^ <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-ParsingTT2008_16-0"><sup><em><strong>a</strong></em></sup></a> <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-ParsingTT2008_16-1"><sup><em><strong>b</strong></em></sup></a> <a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-ParsingTT2008_16-2"><sup><em><strong>c</strong></em></sup></a></span> <span class="reference-text"><cite class="citation book">Epstein, Robert; Roberts, Gary; Beber, Grace (2008). <a class="external text" href="https://books.google.com/?id=aggUJL_5_oQC&printsec=frontcover#v=onepage&q&f=false" rel="nofollow"><em>Parsing the Turing Test:Philosophical and Methodological Issues in the Quest for the Thinking Computer</em></a>. Springer. p. 65. <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/978-1-4020-6710-5" href="https://en.m.wikipedia.org/wiki/Special:BookSources/978-1-4020-6710-5"><bdi>978-1-4020-6710-5</bdi></a>.</cite></span></li>

<li id="cite_note-17"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-17">^{</a></strong></span> }<span class="reference-text"><cite class="citation book">Gopnik, Alison; Meltzoff., Andrew N. (1997). <a class="external text" href="http://mitpress.mit.edu/books/words-thoughts-and-theories" rel="nofollow"><em>Words, thoughts, and theories</em></a>. MIT Press.</cite></span></li>

<li id="cite_note-18"><span class="mw-cite-backlink"><strong><a href="https://en.m.wikipedia.org/wiki/Computing_Machinery_and_Intelligence#cite_ref-18">^{</a></strong></span> }<span class="reference-text"><cite class="citation journal">Meltzoff, Andrew N. (1999). <a class="external text" href="http://ilabs.washington.edu/meltzoff/pdf/99Meltzoff_JCommDisord.pdf" rel="nofollow">"Origins of theory of mind, cognition and communication"</a> <span class="cs1-format">(PDF)</span>. <em>Journal of Communication Disorders</em>. <strong>32</strong> (4): 251–269. <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1016%2FS0021-9924%2899%2900009-X" rel="nofollow">10.1016/S0021-9924(99)00009-X</a>. <a title="PubMed Central" href="https://en.m.wikipedia.org/wiki/PubMed_Central">PMC</a> <span class="cs1-lock-free" title="Freely accessible"><a class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3629913" rel="nofollow">3629913</a></span>. <a class="mw-redirect" title="PubMed Identifier" href="https://en.m.wikipedia.org/wiki/PubMed_Identifier">PMID</a> <a class="external text" href="https://www.ncbi.nlm.nih.gov/pubmed/10466097" rel="nofollow">10466097</a>.</cite></span></li>

</ol>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="References" class="mw-headline">References</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: References" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=6" data-section="6">Edit</a></span></h2>

<ul>

<li><cite id="CITEREFBrooks1990" class="citation"><a title="Rodney Brooks" href="https://en.m.wikipedia.org/wiki/Rodney_Brooks">Brooks, Rodney</a> (1990), <a class="external text" href="http://people.csail.mit.edu/brooks/papers/elephants.pdf" rel="nofollow">"Elephants Don't Play Chess"</a> <span class="cs1-format">(PDF)</span>, <em>Robotics and Autonomous Systems</em>, <strong>6</strong> (1–2): 3–15, <a title="CiteSeerX" href="https://en.m.wikipedia.org/wiki/CiteSeerX">CiteSeerX</a> <span class="cs1-lock-free" title="Freely accessible"><a class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.7539" rel="nofollow">10.1.1.588.7539</a></span>, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1016%2FS0921-8890%2805%2980025-9" rel="nofollow">10.1016/S0921-8890(05)80025-9</a><span class="reference-accessdate">, retrieved <span class="nowrap">30 August</span> 2007</span></cite></li>

<li><cite id="CITEREFCrevier1993" class="citation"><a title="Daniel Crevier" href="https://en.m.wikipedia.org/wiki/Daniel_Crevier">Crevier, Daniel</a> (1993), <em>AI: The Tumultuous Search for Artificial Intelligence</em>, New York, NY: BasicBooks, <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/0-465-02997-3" href="https://en.m.wikipedia.org/wiki/Special:BookSources/0-465-02997-3">0-465-02997-3</a></cite></li>

<li><cite id="CITEREFDreyfus1972" class="citation"><a title="Hubert Dreyfus" href="https://en.m.wikipedia.org/wiki/Hubert_Dreyfus">Dreyfus, Hubert</a> (1972), <a class="mw-redirect" title="What Computers Can't Do" href="https://en.m.wikipedia.org/wiki/What_Computers_Can%27t_Do"><em>What Computers Can't Do</em></a>, New York: MIT Press, <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/978-0-06-011082-6" href="https://en.m.wikipedia.org/wiki/Special:BookSources/978-0-06-011082-6"><bdi>978-0-06-011082-6</bdi></a></cite></li>

<li><cite id="CITEREFDreyfusDreyfus1986" class="citation"><a title="Hubert Dreyfus" href="https://en.m.wikipedia.org/wiki/Hubert_Dreyfus">Dreyfus, Hubert</a>; Dreyfus, Stuart (1986), <em>Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer</em>, Oxford, UK: Blackwell</cite></li>

<li><cite id="CITEREFDreyfus1979" class="citation"><a title="Hubert Dreyfus" href="https://en.m.wikipedia.org/wiki/Hubert_Dreyfus">Dreyfus, Hubert</a> (1979), <em>What Computers </em>Still<em> Can't Do</em>, New York: MIT Press</cite>.</li>

<li><cite id="CITEREFHarnadScherzer2008" class="citation"><a title="Stevan Harnad" href="https://en.m.wikipedia.org/wiki/Stevan_Harnad">Harnad, Stevan</a>; Scherzer, Peter (2008), <a class="external text" href="http://eprints.ecs.soton.ac.uk/14430/" rel="nofollow">"First, Scale Up to the Robotic Turing Test, Then Worry About Feeling"</a>, <em>Artificial Intelligence in Medicine</em>, <strong>44</strong> (2): 83–9, <a title="CiteSeerX" href="https://en.m.wikipedia.org/wiki/CiteSeerX">CiteSeerX</a> <span class="cs1-lock-free" title="Freely accessible"><a class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.4269" rel="nofollow">10.1.1.115.4269</a></span>, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1016%2Fj.artmed.2008.08.008" rel="nofollow">10.1016/j.artmed.2008.08.008</a>, <a class="mw-redirect" title="PubMed Identifier" href="https://en.m.wikipedia.org/wiki/PubMed_Identifier">PMID</a> <a class="external text" href="https://www.ncbi.nlm.nih.gov/pubmed/18930641" rel="nofollow">18930641</a></cite>.</li>

<li><cite id="CITEREFHaugeland1985" class="citation"><a title="John Haugeland" href="https://en.m.wikipedia.org/wiki/John_Haugeland">Haugeland, John</a> (1985), <em>Artificial Intelligence: The Very Idea</em>, Cambridge, Mass.: MIT Press</cite>.</li>

<li><cite id="CITEREFMoravec1976" class="citation"><a title="Hans Moravec" href="https://en.m.wikipedia.org/wiki/Hans_Moravec">Moravec, Hans</a> (1976), <a 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" rel="nofollow"><em>The Role of Raw Power in Intelligence</em></a>, archived from <a class="external text" href="http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html" rel="nofollow">the original</a> on 3 March 2016<span class="reference-accessdate">, retrieved <span class="nowrap">7 November</span> 2007</span></cite></li>

<li><cite id="CITEREFRussellNorvig2003" class="citation"><a title="Stuart J. Russell" href="https://en.m.wikipedia.org/wiki/Stuart_J._Russell">Russell, Stuart J.</a>; <a title="Peter Norvig" href="https://en.m.wikipedia.org/wiki/Peter_Norvig">Norvig, Peter</a> (2003), <a class="external text" href="http://aima.cs.berkeley.edu/" rel="nofollow"><em>Artificial Intelligence: A Modern Approach</em></a> (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/0-13-790395-2" href="https://en.m.wikipedia.org/wiki/Special:BookSources/0-13-790395-2"><bdi>0-13-790395-2</bdi></a></cite></li>

<li><cite id="CITEREFSearle1980" class="citation"><a title="John Searle" href="https://en.m.wikipedia.org/wiki/John_Searle">Searle, John</a> (1980), <a class="external text" href="http://members.aol.com/NeoNoetics/MindsBrainsPrograms.html" rel="nofollow">"Minds, Brains and Programs"</a>, <em>Behavioral and Brain Sciences</em>, <strong>3</strong> (3): 417–457, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1017%2FS0140525X00005756" rel="nofollow">10.1017/S0140525X00005756</a></cite></li>

<li><cite id="CITEREFTuring1950" class="citation"><a title="Alan Turing" href="https://en.m.wikipedia.org/wiki/Alan_Turing">Turing, Alan</a> (October 1950), <a class="external text" href="https://www.csee.umbc.edu/courses/471/papers/turing.pdf" rel="nofollow">"Computing Machinery and Intelligence"</a> <span class="cs1-format">(PDF)</span>, <em>Mind</em>, <strong>LIX</strong> (236): 433–460, <a title="Digital object identifier" href="https://en.m.wikipedia.org/wiki/Digital_object_identifier">doi</a>:<a class="external text" href="https://doi.org/10.1093%2Fmind%2FLIX.236.433" rel="nofollow">10.1093/mind/LIX.236.433</a></cite></li>

<li>Saygin, A. P. (2000), "Turing Test: 50 years later". <em>Minds and Machines</em> <strong>10</strong> (4): 463–518.</li>

<li><a title="Noah Wardrip-Fruin" href="https://en.m.wikipedia.org/wiki/Noah_Wardrip-Fruin">Noah Wardrip-Fruin</a> and Nick Montfort, eds. (2003). <em>The New Media Reader</em>. Cambridge: MIT Press. <a title="International Standard Book Number" href="https://en.m.wikipedia.org/wiki/International_Standard_Book_Number">ISBN</a> <a title="Special:BookSources/0-262-23227-8" href="https://en.m.wikipedia.org/wiki/Special:BookSources/0-262-23227-8">0-262-23227-8</a>. "Lucasfilm's Habitat" pp. 663–677.</li>

</ul>

</div>

<h2 class="section-heading collapsible-heading open-block" tabindex="0"><span id="External_links" class="mw-headline">External links</span><span class="mw-editsection"><a class="mw-ui-icon mw-ui-icon-element mw-ui-icon-minerva-edit-enabled edit-page mw-ui-icon-flush-right" title="Edit section: External links" href="https://en.m.wikipedia.org/w/index.php?title=Computing_Machinery_and_Intelligence&action=edit&section=7" data-section="7">Edit</a></span></h2>

<ul>

<li><a class="external text" href="https://academic.oup.com/mind/article-pdf/LIX/236/433/9866119/433.pdf" rel="nofollow">PDF with the full text of the paper</a></li>

<li><cite class="citation journal">Saygin, Ayse Pinar; Cicekli, Ilyas; Akman, Varol (1999). "An analysis and review of the next 50 years". <em>Minds and Machines</em>: 2000. <a title="CiteSeerX" href="https://en.m.wikipedia.org/wiki/CiteSeerX">CiteSeerX</a> <span class="cs1-lock-free" title="Freely accessible"><a class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.1592" rel="nofollow">10.1.1.157.1592</a></span>.</cite></li>

</ul>

</div>

<div class="content last-modified-barcontent"><span class="last-modified-bartext"><a href="https://en.m.wikipedia.org/wiki/Special:History/Computing_Machinery_and_Intelligence">Last edited 11 days ago</a> by an anonymous user</span></div>

</div>

<h2>RELATED ARTICLES</h2>

<h3><a href="https://en.m.wikipedia.org/wiki/Chinese_room">Chinese room</a></h3>

<p class="ext-related-articles-card-extract">thought experiment arguing that a computer cannot exhibit "understanding"</p>

</div>

</li>

<h3><a href="https://en.m.wikipedia.org/wiki/Philosophy_of_artificial_intelligence">Philosophy of artificial intelligence</a></h3>

</div>

</li>

<h3><a href="https://en.m.wikipedia.org/wiki/Turing_test">Turing test</a></h3>

<p class="ext-related-articles-card-extract">test of a machine's ability to exhibit intelligent behavi</p>

</div>

</li>

</ul>

</aside>

</div>

</footer>

1950, Alan Turing, Computing Machinery and Intelligence

Attachments