The next subleq

2 years ago (github.com)

This language has one opcode that flips a bit and jumps. The creator built a standard library and created a calculator, pointers, functions. Its the most simple OISC that I know of.

Cool! Seems simpler than subleq

  • Is subleq turing complete?

    • Well not exactly, as turing completeness requires infinite memory, and the subleq operands are of finite sizes (and so the addresses they addresses). But, it's like C isn't realy TC as the basic types in it are bounded by there sizes. Your computer doesn't need TC, as it has a finite size too.

      2 replies →

Is it turing complete?

  • As C and Subleq aren't turing complete, it isn't too. Yet it can do somehow effectively any computation your cpu can as it can do and, not, and memory accesses. It seems to actually implement many of the usefull operations in its standard library