Cortex language 3A
Cortex language 3A uses a tape of 16 arbitrary-size unsigned integers. The current cell is the cell pointed to by the cell pointer. The cell pointer wraps around the tape.
Same as brainfuck, e.g. each character is its own command that takes no arguments and returns no value. The one exception to this rule is the
; command, whose result depends on the following character(s).
||Increment the current cell|
||If the current cell is zero, jump to the matching |
||Square the current cell|
||Increment the cell pointer|
||Decrement the current cell (raises an error if cell == 0)|
||If the current cell is nonzero, jump back to the matching |
||Output the Unicode character of the current cell|
||Input an unsigned base-3 integer to the current cell|
||Depends on the next instruction:
All others are ignored. Sequences like
;;X are also ignored.
ROT13 encoder/decoder for user input:
And so on.
Through prime factorization of the tape, as well as unbounded looping using
:, Cortex language 3A is Turing-complete.