Re: Revised Computing Randomness

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Wed, 18 Apr 2001 22:00:15 -0700

Dear Russell:

Here is the cascade rewritten:

Pj(i) = {Rj(Uj(i - 1)) + Self-delimiterj(i)} computes Uj(i)

with the added constraint that the cascade is everywhere elegant.

It is similar to:

1+ 1 = 2, 2 + 1 = 3, ... which eventually produces strings of arbitrary
complexity despite its mechanical repetition. The difference is that 1 + 1
= 2, 2 + 1 = 3 etc is not everywhere elegant so does not meet a complexity
wall.

Hal

Uj(i) is more complex than Uj(i -1)



At 4/19/01, you wrote:

>This last statement is surely incorrect. Because the map Rj is a
>mechanical application of rules, the complexity of B is no greater
>than that of Aj - you can only get out what you put in.
Received on Wed Apr 18 2001 - 19:07:44 PDT