102

102 is an esolang created by User:ChuckEsoteric08 and can be seen as a mix of User:Keymaker's Autopsy and ChuckEsoteric08's other esolang Yurt.

Description

It uses a circular tape of 6 unbounded unsigned integers. Program is run in an implicit infinite loop. There are following instructions:

1 - increment current cell and move 3 commands forward.
0 - move tape pointer right, when on an eighth cell move to the first cell, move 3 commands forward.
2 - if current cell is not equal to the next (with eighth cell compared to the first) 
move 1 command forward, else move 3 commands forward.

Computational class

102 is Turing-complete, since it is possible to translate a variation of Minsky machine with 2 registers into it

Minsky machine variation syntax

We will use following variation:

INC r - increment register r and move to the next instruction
DEC r - decrement register r and move to the next instruction
SKIP r - if register r is 0 skip next instruction
JMP j - move j instructions forward

Both in jumps and regular instruction getting past the last instruction would wrap to the first instruction.

Translation of Minsky machine into an intermediate notation

Each instruction would be translated into a horizontal pattern made out of three lines.

• INC A becomes:

=+>>+>>>>>+>>>>>
=...............
+>+>>>>>=.......

• DEC A becomes:

=+>>>+>>>>+>>>>>
=...............
+>+>>>>>=.......

• INC B becomes:

=+>>>>+>>>+>>>>>
=...............
+>+>>>>>=.......

• DEC B becomes:

=+>>>>>+>>+>>>>>
=...............
+>+>>>>>=.......

• SKIP A becomes:

=+>>=>>>>+>>>>>>+>>>>>
=...>>>>=.............
+>+>>>>>>>>>>>=.......

• SKIP B becomes:

=+>>>>=>>+>>>>>>+>>>>>
=.....>>=.............
+>+>>>>>>>>>>>=.......

• JMP j if j is even becomes:

=(+)>>>>>>>+>>>>>
=(.).............
[+]>[+]>>>>>=.......

Where (x) means command is repeated j times and [x] means repeated j/2 times.

• JMP j if j is odd becomes:

=(+)=......>+>>>>>
=(.)>>>>>>=.......
{+}>{+}>>>>>=.......

Where (x) also means command repeated j times and {x} means repeated (j+1)/2 times.

Translating intermediate notation into 102

This part is easy. First + should be converted into 1, = into 2, . and > into 0. Then we translate resutling program into 102 by putting instruction on the first line, then on second and then on third at the same column into a single string and after we do that we get an 102 program.