simpler yet restated - ouch

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Fri, 17 Nov 2000 16:55:16 -0500

I forgot that I like to use a limit - see (3).

The collection of universes is isomorphic to a collection of non
deterministicly self sorting, randomly generated numbers that sort into
sequences according to:

1) p(i) = {R(p(i - 1)) + PL(i)} is the compressed form of U(i).

where R(p(i - 1)) is the fixed rule set of a particular universe acting on
the previous U(i).

2) U(i) grows in length [number of bits] randomly to avoid Chaitin's limit.

3) When U(i) gets to have a countably infinite number of bits the sequence
ends. From Turing and Hilbert - See Tegmark Section II.

They non deterministicaly self sort because of (2) and U(i -1) contains R
and recognizes any PL(i) suitably larger than PL(i -1).

Hal
Received on Fri Nov 17 2000 - 13:56:40 PST