<?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 17 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=18">3.Next</a>
</p>
<p>relies on the choice of a <a href="page.php?w=model_of_computation">model of computation</a>, which consists in defining the basic operations that are done in a unit of time. When the model of computation is not explicitly specified, it is generally implicitly assumed to be a <a href="page.php?w=multitape_Turing_machine">multitape Turing machine</a>, since several more realistic models of computation, such as <a href="page.php?w=random-access_machine">random-access machine</a>s are asymptotically equivalent for most problems. It is only for very</p><p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=18">3.Next</a>
</p>

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

</card>
</wml>
