<?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="Turing completeness - Page 18 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Turing_completeness&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Turing_completeness&amp;p=19">3.Next</a>
</p>
<p>the program, operating on the input, will eventually stop or will continue forever. It is trivial to create an algorithm that can do this for some inputs, but impossible to do this in general. For any characteristic of the program's eventual output, it is impossible to determine whether this characteristic will hold.</p>

<p>This impossibility poses problems when analyzing real-world computer programs. For example, one cannot write a tool that entirely protects programmers from writing infinite loops or protects users from supplying input that</p><p>
<a accesskey="1" href="page.php?w=Turing_completeness&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Turing_completeness&amp;p=19">3.Next</a>
</p>

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

</card>
</wml>
