Turing Torment
Turing Torment is a weird language by User:Hammy
Commands?
a b c d e
this means "if the turing machine is in state a and on the symbol b, change the symbol to c and go left if d = 1, right if d = 2, and don't move otherwise. then change to state e"
example:
1 0 1 2 2
this changes the current symbol to 1, moves right and changes state to 2 but only if it is in state 1 and the current symbol is 0
// something
this is just a comment, what do you think it does
the initial state is always 1
the initial TAPE is always 0
the state 0 is reserved as a halt state
Alright, those weren't really commands.
But here's the ACTUAL syntax. Convert this number mess (not comments) to binary numbers and add a 1 in the front. Now convert this binary mess into hexadecimal, then find the corresponding EUCS character.
Examples, I guess?
XKCD random number-ish
Since this doesn't have output, this is equivalent to ++++ in bf.
Unconverted:
1 0 4 0 0
Converted:
◀
Computational class
This is turing-complete for pretty obvious reasons.
- It has states (you can make as many as you want, so not a finite state automata)
- It has an infinite tape (like bf, and we all know that's turing complete)
- uhhh
- yeah thats basically it