In the single machine approach one might ask how a number recognizes its own possible successors. The universes are all recursions - as I gave in an earlier post:
p(i) = {R(p(i - 1)) + PL(i)} computes U(i) isomorphic to a universe
configuration.
Any p(i) already contains all the information necessary to recognize its
own possible successors. It simply accepts the first of these to exit the
machine.
Hal
Hal
