We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Turing 110
Turing 110 is a Cellular Automaton like Befunge, but also Turing Tarpit(Note:Because of all the changes, it is starting to not be a Turing Tarpit).It uses Rule 110 or W110 rules as most of the computation.Colored squares are 1, and uncolored squares are 0, so it runs row by row. It adds more square types like 2, -i-,Y,p,and P.Each row is numbered starting from 1.
Code
Commands
| Commands | Do |
|---|---|
0 |
A uncolored square |
1 |
A colored square |
2 |
A block or a square that can not be changed meaning that if a square is 0 or 1, because of the 0 and 1 above can not change it, but when squares under is computing to find it’s number: 0 or 1, it acts like 0
|
-I- |
How to get input.It can only get 1, and 0.Each character has it is own square.If the input is 1, then the right-most - is 1 and the other one is 0, and the I is 0, and if the input is 0, then the left-most - is 1 and the other - is 0, and the I too.
|
Y |
If it is 1 it prints 1, if it is 0, it prints 0.
|
p |
If it is not 0 gonna keep going to the next row, else if 1 instead go to the P that’s on the row number under the pSee example:Example.
|
Structure
Code is written on a list to represent each row.Each row is separate by using a “,” ,and each row must be the same length like this:
[“0”,”0”,”1”,”1”,”0”,”0”], [“2”,”y”,”1”,”0”,”1”,”2”]
Most code are lined up to be easier to read.Sometimes the code is not in list, they are just on lines to mean rows and each character is next to each other, but each line still has to be the same length like this:
001100 2y1012
Rules
At least 1 2 square must be next to a other square that is not 2 or 0, and can not be at row 1.Row 1 can not be only have 0.-I- can only take in 1 or 0, unless there is 8 of them, it can like this:from the left-most -I- to the right-most -I- each getting 1 or 0 depending on the ASCII character.
Examples
Truth Machine
0-I-0 22P22 02Y20 02p20 00300
Cat Program
-I-0-I-0-I-0-I-0-I-0-I-0–I-0-I- 2Y222Y222Y222Y222Y222Y222Y222Y2 2222222222222222222222222222222
Sorry this Cat Program outputs the character in Binary.