<?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="Computational complexity - Page 18 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=19">3.Next</a>
</p>
<p>specific and difficult problems, such as <a href="page.php?w=integer_multiplication">integer multiplication</a> in time  that the explicit definition of the model of computation is required for proofs.</p>

<p><big>Deterministic models</big></p>
<p>A <a href="page.php?w=deterministic_model">deterministic model</a> of computation is a model of computation such that the successive states of the machine and the operations to be performed are completely determined by the preceding state. Historically, the first deterministic models were <a href="page.php?w=u-recursive_function">recursive function</a>s,</p><p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=19">3.Next</a>
</p>

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

</card>
</wml>
