How Much Randomness Is Needed for Statistics?
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.
KeywordsSteklov Institute Random Sequence Bernoulli Trial Randomness Test Binary Expansion
Unable to display preview. Download preview PDF.
- 2.Bienvenu, L., Gács, P., Hoyrup, M., Rojas, C., Shen, A.: Algorithmic tests and randomness with respect to a class of measures. Proceedings of the Steklov Institute of Mathematics 271, 41–102 (2011)Google Scholar
- 3.Downey, R.G., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer (2010)Google Scholar
- 4.Kjos-Hanssen, B.: The probability distribution as a computational resource for randomness testing. J. Log. Anal. 2 (2010)Google Scholar
- 5.Nies, A.: Computability and Randomness. Oxford University Press (2009)Google Scholar
- 8.Shen, A.: One more definition of random sequence with respect to computable measure. In: First World Congress of the Bernoulli Society on Math. Statistics and Probability Theory, Tashkent (1986)Google Scholar