<?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="Probabilistic Turing machine - Page 8 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=probabilistic_Turing_machine&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=probabilistic_Turing_machine&amp;p=9">3.Next</a>
</p>
<p>with an error probability of 1/3. Another class defined using this notion of acceptance is <b><a href="page.php?w=BPL_%28complexity%29">BPL</a></b>, which is the same as <b>BPP</b> but places the additional restriction that languages must be solvable in <a href="page.php?w=Logarithmic_growth">logarithmic</a> <a href="page.php?w=space_complexity">space</a>.</p>

<p><a href="page.php?w=Complexity_class">Complexity class</a>es arising from other definitions of acceptance include <b><a href="page.php?w=RP_%28complexity%29">RP</a></b>, <b>co-RP</b>,</p><p>
<a accesskey="1" href="page.php?w=probabilistic_Turing_machine&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=probabilistic_Turing_machine&amp;p=9">3.Next</a>
</p>

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

</card>
</wml>
