More detail:
Start with an axiom Aj, use it as data for a LISP expression Rj. A program
that computes the value of this expression "B" in AIT has length:
Expression + data + self-delimiter or in this case Rj + Aj +
Self-delimiter. Like this:
P = {Expression(data) + self-delimiter} compute
Dear Russell:
Also since 1+ 1 = 2, 2 + 1 = 3, ... etc. is not everywhere elegant each
successive string is not necessarily more complex than its
preimage. However, in a cascade that is everywhere elegant each successive
string is more complex than its preimage by definition of elegant proof.
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 mechanic
Hal Ruhl wrote:
>
> Here is a revised version of my comments on this subject. I think it fixes
> several aspects of what I have had to say earlier.
>
> Standalone deterministic evolving universes:
>
> Such a universe is describable as a concatenation of single output programs
> of the form:
Here is a revised version of my comments on this subject. I think it fixes
several aspects of what I have had to say earlier.
Standalone deterministic evolving universes:
Such a universe is describable as a concatenation of single output programs
of the form:
Rj(Aj) -> B; Rj(B) ->
George Levy wrote:
>Reflexive, Transitive and Symmetric applies only to the relation R that
>define accessibility.
Exactly.
>So:
>
>Reflexive:
>
>W >|
> <--|
I will assume this is a courageous attempt to draw a curl loop. Nice.
>Transitive:
>
>W1 --> W2 > W3
Yes.
6 matches
Mail list logo
