<?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="Deterministic algorithm - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=deterministic_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=deterministic_algorithm&amp;p=3">3.Next</a>
</p>
<p>a function has a unique value for any input in its <a href="page.php?w=function_domain">domain</a>, and the algorithm is a process that produces this particular value as output.</p>

<p><big> Formal definition </big></p>
<p>Deterministic algorithms can be defined in terms of a <a href="page.php?w=state_machine">state machine</a>: a state describes what a machine is doing at a particular instant in time. State machines pass in a discrete manner from one state to another. Just after we enter the input, the machine is in its initial state or start state.</p><p>
<a accesskey="1" href="page.php?w=deterministic_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=deterministic_algorithm&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
