3L

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

3L is an esolang by User:ChuckEsoteric08 which is a simplification of 2DChanger and with the name taken from 2L but refers to actual number of instructions in both itself and 2L

Specification

The program is on a two-dimensional grid with instruction pointer in top right corner and moving right. It uses binary tape infinite in both directions (unlike 2DChanger which used right-infinite). It has three commands:

• } - flip current cell and move tape pointer right
• + - move tape pointer left. If current cell is 1, turn clockwise, else turn counter-clockwise
• Everything else is a NOP but it is very important and thus counted as a seperate instruction

When running program backwards each command can be reversed, proving that it is reversible:

• } - move tape pointer left and flip current cell
• + - if current cell is 1 turn counter-clockwise, else turn clockwise. Regardless of the value move tape pointer right
• NOP is it's own reverse

Computational class

It is unknown if the language is Turing-complete but it is likely to be so.