Wang B-machine

As presented by Hao Wang (1954, 1957), his basic machine B is an extremely simple computational model equivalent to the Turing machine.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

As presented by Hao Wang (1954, 1957), his basic machine B is an extremely simple computational model equivalent to the Turing machine. It is "the first formulation of a Turing-machine theory in terms of computer-like models" (Minsky, 1967: 200). With only 4 sequential instructions it is very similar to, but even simpler than, the 7 sequential instructions of the Post–Turing machine.

In the same paper, Wang introduced a variety of equivalent machines, including what he called the W-machine, which is the B-machine with an "erase" instruction added to the instruction set.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1331045470 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001331045470 · captured 1767497223.0 · version history

Cite this page as: encyclopegia.org, “Wang B-machine”, snapshot enwiki-001331045470. https://encyclopegia.org/a/wang-b-machine

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.