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 p. 200). With only 4 sequential instructions it is very similar to, but even simpler than, the 7 sequential instructions of the Post-Turing machine.

PropertyValue
dbpprop:abstract
  • 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 p. 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.
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • 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 p. 200). With only 4 sequential instructions it is very similar to, but even simpler than, the 7 sequential instructions of the Post-Turing machine.
rdfs:label
  • Wang B-machine
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of
is owl:sameAs of