2 ms·
It's pretty relevant. A simple arithmetic equation becomes Turing complete if a helper system is attached to execute it over and over on the previous output.
by Dylan16807 5y ago
It's pretty relevant. A simple arithmetic equation becomes Turing complete if a helper system is attached to execute it over and over on the previous output.
The class of things that are Turing complete with one button push is much smaller than the class of things that can run a single step of a Turing machine per button push.
I'm not here to argue about which one is the "real" Turing complete, but they're very distinct groups, and I'd say that getting into the former is significantly more impressive and interesting than the latter.