Re: why not high complexity?

2001-06-18 Thread Karl Stiefvater
[EMAIL PROTECTED] wrote: OO O O Othen lim i-inf e(i) = inf. O O This will not give you a uniform O distribution on infinitely many things. O O O O yes. i agree. O O

Re: why not high complexity?

2001-06-06 Thread juergen
From [EMAIL PROTECTED] Thu May 31 18:14:55 2001 From: Karl Stiefvater [EMAIL PROTECTED] O O Maybe you'd like to write down formally OO what you mean. O O O O sure. i suspect we're talking past each other. O O

Re: why not high complexity?

2001-05-31 Thread Karl Stiefvater
oops. my last message didn't make it to the full list. O O Maybe you'd like to write down formally OO what you mean. O O O O sure. i suspect we're talking past each other.

Re: why not high complexity?

2001-05-30 Thread juergen
O O ??? - There is no way of assigning equal OO O O O nonvanishing probability to infinitely O O O O many mathematical structures, each being O O O represented by a finite set of axioms. OO O O O O okay - strictly

Re: why not high complexity?

2001-05-30 Thread scerir
[EMAIL PROTECTED] wrote: Even if He completely ignores runtime, He still cannot assign high probability to irregular universes with long minimal descriptions. Lee Smolin wrote about some Darwinian super-selection rule, among trees of universes. Do you think there is a possible connection? He

Re: why not high complexity?

2001-05-30 Thread juergen
From: Karl Stiefvater [EMAIL PROTECTED] Date: Mon, 28 May 2001 00:11:33 -0500 O OO OO Max Tegmark suggests that .. all mathematical O O structures are a priori given equal statistical OOOO O weight and Jurgen Schmidhuber counters that O O OOO there