How Much Randomness Is Needed for Statistics?

  • Bjørn Kjos-Hanssen
  • Antoine Taveneaux
  • Neil Thapen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7318)


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.


Steklov Institute Random Sequence Bernoulli Trial Randomness Test Binary Expansion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bienvenu, L., Doty, D., Stephan, F.: Constructive dimension and Turing degrees. Theory of Computing Systems 45(4), 740–755 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 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. 3.
    Downey, R.G., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer (2010)Google Scholar
  4. 4.
    Kjos-Hanssen, B.: The probability distribution as a computational resource for randomness testing. J. Log. Anal. 2 (2010)Google Scholar
  5. 5.
    Nies, A.: Computability and Randomness. Oxford University Press (2009)Google Scholar
  6. 6.
    Merkle, W., Miller, J.S., Nies, A., Reimann, J., Stephan, F.: Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Logic 138, 183–210 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Muchnik, A.A., Semenov, A.L., Uspensky, V.A.: Mathematical metaphysics of randomness. Theoret. Comput. Sci. 207, 263–317 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 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
  9. 9.
    Wang, Y.: Resource bounded randomness and computational complexity. Theoretical Computer Science 237, 33–55 (2000)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Bjørn Kjos-Hanssen
    • 1
  • Antoine Taveneaux
    • 2
  • Neil Thapen
    • 3
    • 4
  1. 1.University of Hawai‘i at MānoaHonoluluUnited States of America
  2. 2.Laboratoire d’Informatique Algorithmique: Fondements et Applications (LIAFA)Université Paris Diderot-Paris 7Paris Cedex 13France
  3. 3.Academy of Sciences of the Czech RepublicPraha 1Czech Republic
  4. 4.Isaac Newton Institute for Mathematical SciencesCambridgeUnited Kingdom

Personalised recommendations