4 ms·
You don't need an infinite list of functions to run into the problems with Turing-completeness. You only need effectively infinite behavior, which means all you
by gavinhoward 4y ago
You don't need an infinite list of functions to run into the problems with Turing-completeness. You only need effectively infinite behavior, which means all you need is effectively infinite possible inputs.
- throwawaymaths 4y agothis is simply untrue. I'm sorry. I recommend studying math a bit more rigorously before making claims in the future.