Hi Bruno:

Since I have not programmed computers beyond the use of simple spread sheet
data organizing displays for many years, about the best I can offer these
days is a kind of flow chart: 

Start with an input space that contains all possible collections of
distinctions. I call these collections Divisors.  [I wish to avoid the use
of the word "information".]  

It is then noted that this collection contains itself. 

Next it is noted that at least one of these Divisors is incomplete in a way
that must be resolved.  This boot straps a dynamic within the input space.

To avoid adding additional types of components to the input space such as
labels on divisors it is simplest to describe the dynamic as creating a
succession of additional copies of divisors and adding them to the input
space. Since any divisor is already present an infinite number of times,
this dynamic is not changing the nature of the content of the input space. 

So far the simulating program is self booting and makes copies of portions
of its input space and outputs the copies to that space. Each of the
identified incomplete divisors is a seed for an additional such program
including any new copies of that divisor.

A particular succession of copies is a trace of a simulation particular

The copy process has no restrictions.  Some traces would be computationally
correct while others would be random and others a blend.  Traces can split.

The output process generates observer moments based on the outputted

The output of new copies of the incomplete Divisor and splitting traces
dovetails the dynamic.    

I think this contains a UD but the unrestricted nature of the traces seems
to makes it more than that. 




-----Original Message-----
From: everything-l...@googlegroups.com
[mailto:everything-l...@googlegroups.com] On Behalf Of Bruno Marchal
Sent: Saturday, December 27, 2008 5:36 AM
To: everything-l...@googlegroups.com
Subject: Re: Revisions to my approach. Is it a UD?

Hi Hal,

To see if your system is a UD, the first thing to do should consist in  
writing a program capable of simulating it on a computer, and then to  
see for which value of some parameters (on which it is supposed to  
dovetail) it simulates a universal Turing machine.
To simulate it on a computer would help you (and us) to interpret the  
words that you are using in the description of your system.



On 27 Dec 2008, at 03:27, Hal Ruhl wrote:

You received this message because you are subscribed to the Google Groups 
"Everything List" group.
To post to this group, send email to everything-l...@googlegroups.com
To unsubscribe from this group, send email to 
For more options, visit this group at 

Reply via email to