Anonymous user
Universal Turing machine: Difference between revisions
m
→{{header|Java}}
(→{{header|D}}: remove unused field) |
|||
Line 616:
{{works with|Java|5+}}
This is an implementation of the universal Turing machine in plain Java using standard libraries only. As generics are used, Java 5 is required. The examples (incrementer and busy beaver) are implemented directly in the main method and executed sequentially. During execution the complete tape and the current
<lang Java5>import java.util.HashMap;
|