Something was bugging me about my proof from yesterday. If we take another tack on proving Turing completeness, all we would have to prove is that we can simulate `SUBLEQ`. Since SUBLEQ
is Turing complete, that’s all we need–just convert each SUBLEQ
into a SUB
, JZ
, and a JLS
. So that means that Tiny as written should be Turing complete.
So how does that work?