Re: Neato chaotic equations for analog computers to display?

examachine_at_gmail.com
Date: 12/24/04 

Date: 23 Dec 2004 16:27:25 -0800

Are you guys joking? Chaitin proved the equivalence of algorithmic
randomness (e.g. incompressibility) to other definitions of randomness
many many years ago, including Martin-Lof or Solovay randomness.
http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ait11.html

etc...

Relevant Pages

  • Re: does sqrt(2) exist in CM?
    ... randomness and Solovay randomness aren't the same thing as random, ... That Borel's paradox of ... which is provably equivalent to strong Chaitin randomness ... In other words, Solovay randomness is just wrong, ...
    (sci.math)
  • Re: does sqrt(2) exist in CM?
    ... >randomness and Solovay randomness aren't the same thing as random, ... pick a number between 0 and 1 "at random" as in probability ... which is provably equivalent to strong Chaitin randomness ... In other words, Solovay randomness is just wrong, ...
    (sci.math)
Quantcast