3 bits, unshackled

3 bits, unshackled is a language kinda like the previous ones before it, primarily 2 Bits, 1 Byte and 3 Bits, 3 Bytes.

Commands

000 - don
001 - act (done on first 2 bits only)
010 - jmp
011 - prt (print)
100 - inc (increment)
101 - dec (decrement)
110 - flp (flip)
111 - end (and print)

If a command is cut off, its end is padded with zeroes.

Infinite loop

010001

Quine

111

Another one,

011

Yet another one,

000111

Finally,

011000

ASCII quine

01111101

And another

0001111

This one is a letter

01111100

Finally

0000110

Funny thing, this is called "acknowledgement"...

Something that prints something else

110111111

Prints:

110000111

Something that prints without a print command

001101

There are no print commands here. Yet, it prints.

Another one,

101101

A third one,

100101

Repeating quine

011010001

Truth Machine..?

011?1?

If you input 0:

011010
011010
011010
...

If you input 1:

011111

Weird go-through machine

011100000000010001

This does something very weird. Also, special JMP wrapping means by the second time you reach the end of the second time around, it goes to the 3rd place.

This is very weird, and acts strange.

Jumping out-of-bounds

010111

This jumps to a position 7. There are only 2 positions.

This, therefore, crashes any machine running this, with an actual 3 bit CPU.

More to explore

You can find more!! :D