5 ms·
of course it's turing complete. the bar for that is very low.
by qqq 18y ago
of course it's turing complete. the bar for that is very low.
- arockwell 18y agoIndeed, you only need one instruction to be turing complete. Subtract and branch if negative is turing complete: http://en.wikipedia.org/wiki/One_instruction_set_computer http://en.wikipedia.org/wiki/One_instruction_set_computer.