Applications of Effective Probability Theory to Martin-Löf Randomness
We pursue the study of the framework of layerwise computability introduced in a preceding paper and give three applications. (i) We prove a general version of Birkhoff’s ergodic theorem for random points, where the transformation and the observable are supposed to be effectively measurable instead of computable. This result significantly improves V’yugin and Nandakumar’s ones. (ii) We provide a general framework for deriving sharper theorems for random points, sensitive to the speed of convergence. This offers a systematic approach to obtain results in the spirit of Davie’s ones. (iii) Proving an effective version of Prokhorov theorem, we positively answer a question recently raised by Fouché: can random Brownian paths reach any random number? All this shows that layerwise computability is a powerful framework to study Martin-Löf randomness, with a wide range of applications.
KeywordsRandom Point Ergodic Theorem Computable Function Iterate Logarithm Correspondence Principle
Unable to display preview. Download preview PDF.
- 4.Nandakumar, S.: An effective ergodic theorem and some applications. In: STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 39–44. ACM Press, New York (2008)Google Scholar
- 5.Galatolo, S., Hoyrup, M., Rojas, C.: Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. (in press, 2007)Google Scholar
- 7.Hoyrup, M., Rojas, C.: An application of Martin-Löf randomness to effective probability theory. In: Proceedings of CiE 2009. LNCS. Springer, Heidelberg (2009)Google Scholar
- 9.Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-Löf randomness over metric spaces. Inf. and Comput. (in press, 2009)Google Scholar
- 16.Galatolo, S., Hoyrup, M., Rojas, C.: A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. Theor. Comput. Sci. (in press, 2007)Google Scholar
- 18.Gács, P.: Lecture notes on descriptional complexity and randomness, http://www.cs.bu.edu/faculty/gacs/papers/ait-notes.pdf