Universal Turing machine: Difference between revisions

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 putimplemented directly in the main method and executed one after the othersubsequentially. During execution the complete tape and the current state +/ tape symbol pair are printed out in every step. This is not a standard implementation, so there is no guarantee of correctness.