2 ms·
Not quite. It has to somehow store and later retrieve a few (infinite) “yes-nos” to be general enough.
by kaba0 5y ago
Not quite. It has to somehow store and later retrieve a few (infinite) “yes-nos” to be general enough.
- phist_mcgee 5y agoAll machines that satisfy a test of whether they can do yes-no, store the result of that yes-no, and then go to another yes-no are verifiably considered yes-no machines, that is, they are yes-no complete.