<?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="Effective method - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=effective_method&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=effective_method&amp;p=5">3.Next</a>
</p>
<p>for calculating the values of a function is called "an <a href="page.php?w=algorithm">algorithm</a>".</p>

<p><big>Computable functions</big></p>
<p>Several independent efforts to give a formal characterization of effective calculability led to a variety of proposed definitions (<a href="page.php?w=general_recursive_function">general recursive function</a>s, <a href="page.php?w=Turing_machine">Turing machine</a>s, <a href="page.php?w=%3F-calculus">?-calculus</a>) that later were shown to be equivalent. The notion captured by these definitions is known</p><p>
<a accesskey="1" href="page.php?w=effective_method&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=effective_method&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
