<?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="Least fixed point - Page 12 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=least_fixed_point&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=least_fixed_point&amp;p=13">3.Next</a>
</p>
<p>and is the greatest fixed point if the greatest fixed point exists. The optimal fixed point allows formal study of <a href="page.php?w=recursive">recursive</a> and <a href="page.php?w=corecursive">corecursive</a> functions that do not converge with the least fixed point. Unfortunately, whereas <a href="page.php?w=Kleene%27s_recursion_theorem">Kleene's recursion theorem</a> shows that the least fixed point is effectively computable, the optimal fixed point of a <a href="page.php?w=computable_function">computable function</a> may be a non-computable</p><p>
<a accesskey="1" href="page.php?w=least_fixed_point&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=least_fixed_point&amp;p=13">3.Next</a>
</p>

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

</card>
</wml>
