- Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Hal Ruhl <hjr.domain.name.hidden>

Date: Thu, 09 Nov 2000 23:01:17 -0800

In my last post I arrived at a middle ground something - a superverse -

from an unstable nothing or from an unstable everything. The superverse

must have a random dynamic that can include the spontaneous crystallization

of incomplete, finite, consistent FAS [N-bit, ifc-FAS] I can pick up the

description of my model at step 9.

9) N-bit, ifc-FAS are composed of:

a) A finite theorem set [no more than 2^[N + c] as per AIT.]

b) Each theorem has a finite AIT complexity less than or equal to N +

c bits

and thus the FAS has

b) A finite symbol set or alphabet.

c) A finite set of axioms

d) A finite set of rules

10) Some such ifc-FAS are isomorphic to mathematical objects U [finite

strings of bits] that are themselves isomorphic to universes.

11) All such universes have physical realization.

12) A low complexity class of such ifc-FAS have just one axiom.

13) The proposal is that our physical universe is isomorphic to a

mathematical object U that is described by an ifc-FAS in this class. More

precisely a currently realized physical configuration of the universe - a

CRPC(i) is isomorphic to a current string configuration - a U(i) that is

described by a currently expressed theorem of the ifc-FAS - a p(i).

MID STAGE DYNAMICS

14) The only dynamic available in such a ifc-FAS is a recursive enumeration

as follows:[viewing p(i) as an AIT shortest possible program]

p(i) = {R acting on p(i - 1), PL(i)} will compute U(i) isomorphic to

CRPC(i).

where R is the rule set of the ifc-FAS, PL(i) is the self delimiter of AIT and

p(1) = {R acting on [single axiom], PL(1)} will compute U(1) isomorphic to

CRPC(1) and

[single axiom] describes U(0) isomorphic to CRPC(0).

15) Dynamic results so far:

a) p(i) gets longer with each step of the recursion.

b) Thus the information content of U(i) is higher than U(i - 1) -

isomorphic to the Second Law of Thermodynamics.

16) For the following reasons I think the simplest [perhaps only]

isomorphic physical realization consistent with all of the above is a

spacial grid structure composed of a finite number of discrete points.

a) In the recursion each p(i - 1) has to halt and output U(i - 1) before

p(i) can have data.

b) There can be no infinitesimal difference in the length of successive p(i).

c) The resulting finite as opposed to infinitesimal amount of change in

configuration complexity with each recursion step can not be partitioned

among an infinite number of elements of a universe without a establishing a

contradiction in the recursion dynamic with "a" above.

In this view these points are isomorphic through the mathematical object U

to the alphabet of the ifc-FAS.

I will stop there to see if anyone has comments.

Hal

Received on Thu Nov 09 2000 - 20:14:49 PST

Date: Thu, 09 Nov 2000 23:01:17 -0800

In my last post I arrived at a middle ground something - a superverse -

from an unstable nothing or from an unstable everything. The superverse

must have a random dynamic that can include the spontaneous crystallization

of incomplete, finite, consistent FAS [N-bit, ifc-FAS] I can pick up the

description of my model at step 9.

9) N-bit, ifc-FAS are composed of:

a) A finite theorem set [no more than 2^[N + c] as per AIT.]

b) Each theorem has a finite AIT complexity less than or equal to N +

c bits

and thus the FAS has

b) A finite symbol set or alphabet.

c) A finite set of axioms

d) A finite set of rules

10) Some such ifc-FAS are isomorphic to mathematical objects U [finite

strings of bits] that are themselves isomorphic to universes.

11) All such universes have physical realization.

12) A low complexity class of such ifc-FAS have just one axiom.

13) The proposal is that our physical universe is isomorphic to a

mathematical object U that is described by an ifc-FAS in this class. More

precisely a currently realized physical configuration of the universe - a

CRPC(i) is isomorphic to a current string configuration - a U(i) that is

described by a currently expressed theorem of the ifc-FAS - a p(i).

MID STAGE DYNAMICS

14) The only dynamic available in such a ifc-FAS is a recursive enumeration

as follows:[viewing p(i) as an AIT shortest possible program]

p(i) = {R acting on p(i - 1), PL(i)} will compute U(i) isomorphic to

CRPC(i).

where R is the rule set of the ifc-FAS, PL(i) is the self delimiter of AIT and

p(1) = {R acting on [single axiom], PL(1)} will compute U(1) isomorphic to

CRPC(1) and

[single axiom] describes U(0) isomorphic to CRPC(0).

15) Dynamic results so far:

a) p(i) gets longer with each step of the recursion.

b) Thus the information content of U(i) is higher than U(i - 1) -

isomorphic to the Second Law of Thermodynamics.

16) For the following reasons I think the simplest [perhaps only]

isomorphic physical realization consistent with all of the above is a

spacial grid structure composed of a finite number of discrete points.

a) In the recursion each p(i - 1) has to halt and output U(i - 1) before

p(i) can have data.

b) There can be no infinitesimal difference in the length of successive p(i).

c) The resulting finite as opposed to infinitesimal amount of change in

configuration complexity with each recursion step can not be partitioned

among an infinite number of elements of a universe without a establishing a

contradiction in the recursion dynamic with "a" above.

In this view these points are isomorphic through the mathematical object U

to the alphabet of the ifc-FAS.

I will stop there to see if anyone has comments.

Hal

Received on Thu Nov 09 2000 - 20:14:49 PST

*
This archive was generated by hypermail 2.3.0
: Fri Feb 16 2018 - 13:20:07 PST
*