Re: simpler yet

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Thu, 16 Nov 2000 21:25:17 -0800

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
Received on Thu Nov 16 2000 - 18:51:58 PST