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.
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.
But is it though? I once read you can implement infinite memory address register with it, Ill look it up
What about it?