<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Computing Machinery and Intelligence - Page 36 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Computing_Machinery_and_Intelligence&amp;p=35">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computing_Machinery_and_Intelligence&amp;p=37">3.Next</a>
</p>
<p>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".</p>

<p>
:* 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</p><p>
<a accesskey="1" href="page.php?w=Computing_Machinery_and_Intelligence&amp;p=35">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computing_Machinery_and_Intelligence&amp;p=37">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
