Constructive Equivalence Relations on Computable Probability Measures
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.
KeywordsComputable Strategy Computable Function Uniform Measure Random Real Computable Measure
Unable to display preview. Download preview PDF.
- 1.Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Book in preparation, See: http://www.mcs.vuw.ac.nz/~downey
- 7.Schnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit. Springer-Verlag Notes in Mathematics, p. 218 (1971)Google Scholar
- 9.van Lambalgen, M.: Random sequences. Doctoral dissertation, University of Amsterdam (1987)Google Scholar