Anonymous user
Universal Turing machine: Difference between revisions
m
→{{header|Java}}: Generics and foreach started in Java 5, more-correct highlighting, no signatures on examples
m (→{{header|Java}}: Generics and foreach started in Java 5, more-correct highlighting, no signatures on examples) |
|||
Line 576:
=={{header|Java}}==
{{works with|Java
This is an implementation of the universal Turing machine in plain Java using standard libraries only. As generics are used, Java
<lang Java5>import java.util.HashMap;▼
<lang Java>▼
▲import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
Line 773 ⟶ 772:
System.out.println("Output (bb): " + machine.runTM());
}
{{out}}
<pre>[1, 1, 1] --- (q0,1)▼
▲[1, 1, 1] --- (q0,1)
[1, 1, 1] --- (q0,1)
[1, 1, 1] --- (q0,1)
Line 799 ⟶ 796:
[1, 1, 1, 1, 1, 1] --- (c,1)
[1, 1, 1, 1, 1, 1] --- (halt,1)
Output (bb): [1, 1, 1, 1, 1, 1]</pre>
=={{header|Mercury}}==
|