# Simplest system?

From: Hal Ruhl <HalRuhl.domain.name.hidden>
Date: Thu, 15 May 2008 21:32:54 -0500

I think the following is the simplest system that has all the necessary
features.

1) Assume a complete ensemble of divisors [information? But I want to avoid
that term] and
its own divisions - collections of divisors. Call it the [All]. The [All]
contains itself since it is a collection of divisors.

2) Define N(i) as a division of the [All] that is empty of divisors or
divisions of the [All]. Call it a Nothing.

3) Define S(i) as a division of the [All] that contains a portion of the
[All]. Call them Somethings [evolving universes].

4) Define Q(i) as a division of the [All] that contains a portion of the
[All]. Call them questions.

5) Define cQ(i):S(i):N(i) as compulsatory questions for S(i) or N(i) that
must be resolved by the S(i) or N(i).

6) Define uQ(i):S(i):N(i) as questions for S(i) or N(i) that are not
resolvable by the contents of S(i) or N(i). This is incompleteness. Of
course all Q(i) are uQ(i) for the N(i).

7) Define ucQ(i):S(i):N(i) as compulsatory questions for S(i) or N(i) that
are not resolvable by the contents of S(i) or N(i).

8) Duration is a ucQ(i) for all N(i) and makes the N(i) unstable so they
eventually spontaneously become S(i). This ucQ(i) bootstraps time.

9) Duration is also a ucQ(i) for S(i) because any internal notion of
duration of the current state is just the history of past states and not an
absolute answer for the current state. This makes S(i) unstable so
it eventually spontaneously becomes S(i+1).

10) S(i+1) is always greater than S(i) regarding its content of [All]. The
process continues until S(i) contains [All].

11) The [All] content delta between S(i) and S(i+1) will contain divisors
and collections of divisors that answer no current Q(i) and this requires a
selection mechanism acting on this data during the S(i) to S(i+1)
transition.

12) The selector mechanism can be the simplest possible or be an ensemble of
components ranging from simple to very complex. Some could be complex
enough to be SAS.

Hal Ruhl

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at http://groups.google.com/group/everything-list?hl=en
-~----------~----~----~----~------~----~------~--~---
Received on Thu May 15 2008 - 22:33:14 PDT

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