<?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 theory - Page 19 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=computational_complexity_theory&amp;p=18">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity_theory&amp;p=20">3.Next</a>
</p>
<p>a pencil and paper. It is believed that if a problem can be solved by an algorithm, there exists a Turing machine that solves the problem. Indeed, this is the statement of the <a href="page.php?w=Church-Turing_thesis">Church-Turing thesis</a>. Furthermore, it is known that everything that can be computed on other models of computation known to us today, such as a <a href="page.php?w=RAM_machine">RAM machine</a>, <a href="page.php?w=Conway%27s_Game_of_Life">Conway's Game of Life</a>, <a href="page.php?w=cellular_automata">cellular automata</a>,</p><p>
<a accesskey="1" href="page.php?w=computational_complexity_theory&amp;p=18">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity_theory&amp;p=20">3.Next</a>
</p>

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

</card>
</wml>
