# Eliminating the machine

```All counting numbers exist in countable infinite copies in a seething foamy
fratal.```
```
The collection of universes is isomorphic to non deterministicly self
sorting sequences U(i) of these numbers that upon chance encounters sort
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
on how much information you can put into an N-bit number.

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 deterministicly self sort because of (2) and U(i -1) contains R
and recognizes any PL(i) suitably larger than its own PL(i -1) - i.e. U(i
-1) picks the first good number it encounters out of a countable infinite
set of potential successors.

(2) and (3) may not be independent of (1).

Alternate beginning: No numbers exist.  This is unstable logically. It
contains no answer to its own stability.  It decays into all counting
numbers which is sufficient to contain the answer.

Hal

```