Execute a Markov algorithm: Difference between revisions
Content added Content deleted
m (→{{header|Java}}: Use the version argument in "works with") |
m (→Ruleset 5: http://en.wikipedia.org/wiki/Busy_beaver) |
||
Line 101: | Line 101: | ||
==Ruleset 5== |
==Ruleset 5== |
||
A simple [http://en.wikipedia.org/wiki/Turing_machine Turing machine], |
|||
⚫ | |||
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. |
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. |