Beatnik Extended

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

Beatnik Extended is two seperate Turing complete extensions of Beatnik created by User:ChuckEsoteric08

Additions

Infinite Beatnik

This version is only different from Beatnik by having unbounded non-negative integers instead of bytes on a stack. This version is Turing complete by reducing Minsky machine and other counter machines into it. Difficulty is that it can only access top two values on the stack to make, for example, interpreter of another esolang into it, Unlike the next one.

Reversing Beatnik

It adds additional opcode:

18 - reverse the stack

The language is Turing complete because it is easy to translate brainfuck or even Turing machine itself into it

Assembly notation

To further simplify programming in them, there is additional Assembly-like notation for opcodes that is compatible with both of these and original Beatnik that would later be compiled into either of them:

Op     Cmd
5 n    psh n
6      pop
7      add
8      inp
9      out
10     sub
11     swp
12     dup
13 n   fz n
14 n   fnz n
15 n   bz n
16 n   bnz n
17     hlt
18     rev (only RevBeatnik)
none   lbl: (declare lable for jumping)