<?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="Computable function - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=computable_function&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computable_function&amp;p=3">3.Next</a>
</p>
<p></p>

<p>Many such models of computation have been proposed, the major ones being <a href="page.php?w=Turing_machine">Turing machine</a>s, <a href="page.php?w=register_machine">register machine</a>s, <a href="page.php?w=lambda_calculus">lambda calculus</a> and <a href="page.php?w=general_recursive_function">general recursive function</a>s. Although these four are of a very different nature, they provide exactly the same class of computable functions, and, for every model of computation that has ever been proposed, the computable functions for</p><p>
<a accesskey="1" href="page.php?w=computable_function&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computable_function&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
