<?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 machine equivalents - Page 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Turing_machine_equivalents&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Turing_machine_equivalents&amp;p=8">3.Next</a>
</p>
<p>boxes acting as an unbounded bitstring memory, and the set of instructions constituting a program.</p>

<p><big> Wang machines </big></p>
<p>In an influential paper, <a href="page.php?w=Hao_Wang_%28academic%29">Hao Wang</a> reduced Post's "<a href="page.php?w=Post-Turing_machine">formulation 1</a>" to machines that still use a two-way infinite binary tape, but whose instructions are simpler - being the "atomic" components of Post's instructions - and are by default executed sequentially (like a "computer program").  His stated principal purpose was to</p><p>
<a accesskey="1" href="page.php?w=Turing_machine_equivalents&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Turing_machine_equivalents&amp;p=8">3.Next</a>
</p>

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

</card>
</wml>
