Mathematical metaphysics of randomness
Theoretical Computer Science - Special issue Kolmogorov complexity
Resource bounded randomness and computational complexity
Theoretical Computer Science
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Computability and Randomness
Constructive Dimension and Turing Degrees
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
| Hi-index | 0.00 |
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure λ, a choice needs to be made. One approach is to allow randomness tests to access the measure λ as an oracle (which we call the "classical approach"). The other approach is the opposite one, where the randomness tests are completely effective and do not have access to the information contained in λ (we call this approach "Hippocratic"). While the Hippocratic approach is in general much more restrictive, there are cases where the two coincide. The first author showed in 2010 that in the particular case where the notion of randomness considered is Martin-Löf randomness and the measure λ is a Bernoulli measure, classical randomness and Hippocratic randomness coincide. In this paper, we prove that this result no longer holds for other notions of randomness, namely computable randomness and stochasticity.