Anonymous user
Execute a Markov algorithm: Difference between revisions
m
→Ruleset 5: http://en.wikipedia.org/wiki/Busy_beaver
m (→{{header|Java}}: Use the version argument in "works with") |
m (→Ruleset 5: http://en.wikipedia.org/wiki/Busy_beaver) |
||
Line 101:
==Ruleset 5==
A simple [http://en.wikipedia.org/wiki/Turing_machine Turing machine],
A simple Turing machine, implementing a three-state busy beaver. The tape consists of 0s and 1s, the states are A, B, C and H (for Halt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.▼
implementing a three-state [http://en.wikipedia.org/wiki/Busy_beaver busy beaver].
▲
All parts of the initial tape the machine operates on have to be given in the input.
Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
| |||