<?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="Complexity class - Page 26 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Complexity_class&amp;p=25">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Complexity_class&amp;p=27">3.Next</a>
</p>
<p>condition, then the NTM accepts the input. In this way, an NTM can be thought of as simultaneously exploring all computational possibilities in parallel and selecting an accepting branch. NTMs are not meant to be physically realizable models, they are simply theoretically interesting abstract machines that give rise to a number of interesting complexity classes (which often do have physically realizable equivalent definitions). </p>

<p>The <a href="page.php?w=time_complexity">time complexity</a> of an NTM is the maximum number of steps that</p><p>
<a accesskey="1" href="page.php?w=Complexity_class&amp;p=25">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Complexity_class&amp;p=27">3.Next</a>
</p>

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

</card>
</wml>
