<?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="Nondeterministic Turing machine - Page 17 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=nondeterministic_Turing_machine&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=nondeterministic_Turing_machine&amp;p=18">3.Next</a>
</p>
<p>of states, rather than conventional bits, there is sometimes a misconception that <a href="page.php?w=quantum_computer">quantum computer</a>s are NTMs. However, it is believed by experts (but has not been proven) that the power of quantum computers is, in fact, incomparable to that of NTMs; that is, problems likely exist that an NTM could efficiently solve that a quantum computer cannot and vice versa. In particular, it is likely that <a href="page.php?w=NP-complete">NP-complete</a> problems are solvable by NTMs but not by quantum computers in</p><p>
<a accesskey="1" href="page.php?w=nondeterministic_Turing_machine&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=nondeterministic_Turing_machine&amp;p=18">3.Next</a>
</p>

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

</card>
</wml>
