Pretty much turing, except that any 8-bit ASCII character can go on the tapes.
Turing Emulator
I also wrote a program that parses sequences of binary digits into numbers from 0 thru 3. Example:
S00011011E ==> 0123-DONE--
Yes, you must have S and E at the start and end of input
1,S 1,S,>
1,1 11,1,>
1,0 10,0,>
11,1 23,-,<
10,1 21,-,<
11,0 22,-,<
10,0 20,-,<
23,1 2,3,>
22,1 2,2,>
21,0 2,1,>
20,0 2,0,>
2,- 1,-,>
1,E 3,E,<
3,- 3,-,<
3,0 3,0,<
3,1 3,1,<
3,2 3,2,<
3,3 3,3,<
3,S 4,S,>
4,- 4,-,>
4,0 40,-,<
4,1 41,-,<
4,2 42,-,<
4,3 43,-,<
40,- 40,-,<
41,- 41,-,<
42,- 42,-,<
43,- 43,-,<
40,0 50,0,>
40,1 50,1,>
40,2 50,2,>
40,3 50,3,>
41,0 51,0,>
41,1 51,1,>
41,2 51,2,>
41,3 51,3,>
42,0 52,0,>
42,1 52,1,>
42,2 52,2,>
42,3 52,3,>
43,0 53,0,>
43,1 53,1,>
43,2 53,2,>
43,3 53,3,>
50,- 4,0,>
51,- 4,1,>
52,- 4,2,>
53,- 4,3,>
40,S 4,0,>
41,S 4,1,>
42,S 4,2,>
43,S 4,3,>
4,E 6,-,<
6,- 6,-,<
6,0 60,0,>
6,1 60,1,>
6,2 60,2,>
6,3 60,3,>
60,- 61,-,>
61,- 62,D,>
62,- 63,O,>
63,- 64,N,>
64,- 65,E,>
I must have wayyy too much time on my hands. But hey, at least I didn't write it in BF :) |
