Turing Machine But Way Worse
Turing Machine But Way Worse (abbreviated TMBWW) is a programming language made in December 2018, by a code golf user MilkyWay90. It is based on Turing machines that support I/O.
Tutorial
A tutorial for TMBWW can be found here.
A tutorial on Turing Machines can be found here
Syntax
0/1 <any char> 0/1
if the robot sees the number 0/1 and state is <any char> replace the number with 0/1
0/1 <any char> 0/1
move left/right, respectively go to state <any char> print (will be explained in more detail)
0/1
Stop/halt the program if this is 1
For example,
0 0 1 1 a 0 1
Would be "if the number the robot is seeing is 0 and the robot is in state 0, replace the number with 1, move right, go to state a, don't print, and halt the program (stop the program)"
Printing
Let's say that the tape is
<... infinite zeros ...> 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 <... infinite zeros ...>
^
and you decide to print.
First, the program would separate the tape into separate pieces of length 8:
<... infinite zeros ...>|0 1 0 1 0 1 0 1|0 1 0 1 0 1 0 1|0 1 0 1 0 1 0 1|<... infinite zeros ...>
^
The eight bits that the robot is in is `0 1 0 1 0 1 0 1`
Converting that to base-10, we get "85", and that in ASCII is "U".
Congratulations, you have printed the character "U".
Note: Turing Machine But Way Worse doesn't append a trailing newline to the output (printing A and then B would result in AB, not A\nB)
- Input
Let's say that the input is "hi".
Taking the ASCII values of these gives us "['01101000', '01101001']".
Concatenating the list gives us "0110100001101001".
Therefore, the tape is
<... infinite zeros ...>0 1 1 0 1 0 0 0 0 1 1 0 1 0 0 1<... infinite zeros ...>`.
If there is no input, the tape is
<... infinite zeros ...>0 0 0 0 0 0 0 0<... infinite zeros ...>`.
Programs
Take first input char and print it
0 0 0 1 0 1 1 1 0 1 1 0 1 1
0 0 0 1 1 0 0 1 0 1 1 1 0 0 0 1 0 1 2 0 0 1 1 1 1 a 0 0 0 2 0 1 3 0 0 1 2 1 1 b 0 0 0 3 0 1 4 0 0 1 3 1 1 c 0 0 0 4 0 1 5 0 0 1 4 1 1 d 0 0 0 5 0 1 6 0 0 1 5 1 1 e 0 0 0 6 0 1 7 0 0 1 6 1 1 f 0 0 0 7 0 1 g 0 0 1 7 1 1 g 0 0 0 a 0 1 b 0 0 1 a 1 1 b 0 0 0 b 0 1 c 0 0 1 b 1 1 c 0 0 0 c 0 1 d 0 0 1 c 1 1 d 0 0 0 d 0 1 e 0 0 1 d 1 1 e 0 0 0 e 0 1 f 0 0 1 e 1 1 f 0 0 0 f 0 1 0 1 0 1 f 1 1 0 1 0 0 g 0 1 g 0 1 1 g 1 1 g 0 1
0 0 0 1 1 0 0 0 1 1 1 2 0 0 0 2 0 1 3 0 0 0 3 0 1 4 0 0 0 4 1 0 5 1 0 0 5 0 0 6 0 0 0 6 1 1 7 0 0 0 7 0 1 8 0 0 1 8 0 1 9 0 0 0 9 1 1 10 0 0 0 10 0 1 11 0 0 0 11 1 1 12 1 0 0 12 0 0 13 0 0 1 13 0 0 14 0 0 0 14 0 0 15 0 0 1 15 1 0 16 0 0 0 16 1 1 17 1 0 1 17 1 1 18 1 0 0 18 1 1 19 0 0 0 19 1 1 20 1 0 0 20 0 1 21 0 0 0 21 0 1 22 0 0 0 22 1 1 23 0 0 0 23 0 1 24 0 0 0 24 1 1 25 0 0 0 25 1 1 26 1 0 0 26 0 0 27 0 0 1 27 0 0 28 0 0 1 28 0 0 29 1 0 0 29 0 0 30 0 0 1 30 0 0 31 0 0 0 31 0 0 32 0 0 0 32 0 0 33 0 0 1 33 1 0 34 0 0 1 34 1 0 35 0 0 1 35 1 0 36 0 0 1 36 0 0 37 0 0 0 37 1 1 38 1 0 0 38 1 0 39 0 0 1 39 0 1 40 1 0 1 40 0 0 41 0 0 0 41 1 1 42 0 0 0 42 0 1 43 0 0 1 43 0 1 44 0 0 1 44 1 1 45 0 0 1 45 0 0 46 1 0 1 46 0 0 47 0 0 0 47 1 0 48 0 0 0 48 1 0 49 0 0 1 49 0 1 50 1 0 1 50 0 0 51 1 0 0 51 0 0 52 0 0 1 52 1 0 53 0 0 1 53 0 1 54 0 0 1 54 1 1 55 0 0 0 55 0 1 56 0 0 0 56 0 1 57 0 0 1 57 0 1 58 0 0 0 58 0 1 59 0 0 0 59 1 1 0 1 1
Computational class
This emulates a 2 state Turing machine except with the addition of I/O which by definition means it is Turing complete. Brainfuck can also be converted into this language, also making it Turing complete.