<?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="Transcomputational problem - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Transcomputational_problem&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Transcomputational_problem&amp;p=4">3.Next</a>
</p>
<p>requires testing of a total of 2<sup>309</sup> combinations of inputs. Since the number 2<sup>309</sup> is a transcomputational number (that is, a number greater than 10<sup>93</sup>), the problem of testing such a system of <a href="page.php?w=integrated_circuit">integrated circuit</a>s is a transcomputational problem. This means that there is no way one can verify the correctness of the circuit for all combinations of inputs through <a href="page.php?w=Brute-force_search">brute force</a> alone.</p>

<p><big>Pattern recognition</big></p>
<p>Consider</p><p>
<a accesskey="1" href="page.php?w=Transcomputational_problem&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Transcomputational_problem&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
