Abstract
We study the equivalence relations on probability measures corresponding respectively to having the same Martin-Löf random reals, having the same Kolmogorov-Loveland random reals, and having the same computably random reals. In particular, we show that, when restricted to the class of strongly positive generalized Bernoulli measures, they all coincide with the classical equivalence, which requires that two measures have the same nullsets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Book in preparation, See: http://www.mcs.vuw.ac.nz/~downey
Kakutani, S.: On the equivalence of infinite product measures. Ann. Math. 49, 214–224 (1948)
Martin-Löf, P.: The definition of random sequences. Information and Control 9(6), 602–619 (1966)
Merkle, W., Miller, J.S., Nies, A., Reimann, J., Stephan, F.: Kolmogorov-Loveland Randomness and Stochasticity. Annals of Pure and Applied Logic 138(1-3), 183–210 (2006)
Muchnik, A.A., Semenov, A.L., Uspensky, V.A.: Mathematical metaphysics of randomness. Theor. Comput. Sci. 207(2), 263–317 (1998)
Schnorr, C.P.: A unified approach to the definition of random sequences. Math. Systems Theory 5, 246–258 (1971)
Schnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit. Springer-Verlag Notes in Mathematics, p. 218 (1971)
Shen’, A.Kh.: On relations between different algorithmic definitions of randomness. Soviet Mathematical Doklady 38, 316–319 (1988)
van Lambalgen, M.: Random sequences. Doctoral dissertation, University of Amsterdam (1987)
Vovk, V.G.: On a randomness criterion. Soviet Mathematics Doklady 35, 656–660 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bienvenu, L. (2006). Constructive Equivalence Relations on Computable Probability Measures. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_12
Download citation
DOI: https://doi.org/10.1007/11753728_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)