Anonymous user
Universal Turing machine: Difference between revisions
→{{header|Java}}
Line 374:
=={{header|Java}}==
{{works with|Java Virtual Machine|6.0}}
This is an implementation of the universal Turing machine in plain Java using standard libraries only. As generics are used, Java 6 is required. The examples (incrementer and busy beaver) are put in the main method and executed one after the other. During execution the complete tape and the current state + tape symbol are printed out in every step.
<lang Java>
import java.util.HashMap;
Line 569 ⟶ 573:
}
</lang>
=={{header|Mercury}}==
| |||