4 ms·
Two/three counters with increment, decrement and test for zero operations is a Turing complete system: https://en.m.wikipedia.org/wiki/Counter_machine https://
by H8crilA 7y ago
Two/three counters with increment, decrement and test for zero operations is a Turing complete system:
https://en.m.wikipedia.org/wiki/Counter_machine https://en.m.wikipedia.org/wiki/Counter_machine
In practice it's actually hard to make something with a potentially infinite memory that is not Turing complete.