SequenceScript

SequenceScript is invented by User:A.

50+60(Save in [00])

00=32
01=3C
02=[00]
03=[01]
02+[03]
00=[02]

x=y

Set x(which is a place in the internal storage, x is a hex number) into y(represents a place of internal storage or a value, which is a hex number).

x+y

Increment x(A place in the internal storage) by y

x-y

Decrement x(A place in the internal storage) by y

[X]

A place in the internal storage(same as the one in x=y)

Add from 1 to 100(Save in #0)

00=00
02=[00]
03=[02]
03=64:08
02+[03]
03+01
00=00:04
00=[02]

x=y:z

If x(A place in the internal storage) equals y, jump to sequence numbered z.(z is hex)(The sequences start with 0)

Computational Class

It seems that it is Turing-complete, but it is actually not. Using implementation of the Collatz function: + x+01(x can be [00], [01], or [02].) - x-01 < and > does not produce code directly---it is just switching vars. [ x=0:y y is where the other bracket is. ] x=???:y Obviously, it can't implement unequality.