<?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="Theory of computation - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=theory_of_computation&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=theory_of_computation&amp;p=4">3.Next</a>
</p>
<p><a href="page.php?w=abstraction">abstraction</a> of computers called a model of computation. Several models exist for this purpose, such as the <a href="page.php?w=Turing_machine">Turing machine</a>. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" model of computation (see <a href="page.php?w=Church-Turing_thesis">Church-Turing thesis</a>). It might seem that the potentially infinite memory</p><p>
<a accesskey="1" href="page.php?w=theory_of_computation&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=theory_of_computation&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
