Le 13-déc.-06, à 02:45, Russell Standish a écrit :
> Essentially that is the Occam razor theorem. Simpler universes have
> higher probability.
In the ASSA(*) realm I can give sense to this. I think Hal Finney and
Wei Dai have defended something like this. But in the comp RSSA(**)
realm, strictly speaking even the notion of "one" universe (even
considered among other universes or in a multiverse à-la Deutsch) does
not make sense unless the comp substitution level is *very* low. Stable
appearances of local worlds emerge from *all* computations making all
apparent (and thus sufficiently complex) world not "turing emulable".
Recall that "I am a machine" entails "the apparent universe cannot be a
machine" (= cannot be turing-emulable (cf UDA(***)).
Bruno
For the new people I recall the acronym:
(*) ASSA = absolute self-sampling assumption
(**) RSSA = relative self-sampling assumption
The SSA idea is in the ASSA realm comes from Nick Bostrom, if I
remember correctly.
(***) UDA: see for example
http://iridia.ulb.ac.be/~marchal/publications/SANE2004MARCHAL.htm
http://iridia.ulb.ac.be/~marchal/
--~--~---------~--~----~------------~-------~--~----~
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 Wed Dec 13 2006 - 09:54:23 PST