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. It is "the first formulation of a Turing-machine theory in terms of computer-like models" (Minsky (1967) 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.
Wikipage redirect
primaryTopic
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. It is "the first formulation of a Turing-machine theory in terms of computer-like models" (Minsky (1967) 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.
has abstract
As presented by Hao Wang (1954 ...... added to the instruction set.
@en
Concebida por Hao Wang (1954, ...... nada ao conjunto de instruções
@pt
Wikipage page ID
Wikipage revision ID
546,221,420
subject
comment
As presented by Hao Wang (1954 ...... added to the instruction set.
@en
Concebida por Hao Wang (1954, ...... nada ao conjunto de instruções
@pt
label
Máquina Wang-b
@pt
Wang B-machine
@en