Layerwise Computability and Image Randomness
- 64 Downloads
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to the image distribution F(P) (for some distribution P and some mapping F) if and only if it has a P-random F-preimage. This result (for computable distributions and mappings, and Martin-Löf randomness) was known for a long time (folklore); for layerwise computable mappings it was mentioned in Hoyrup and Rojas (2009, Proposition 5) (even for more general case of computable metric spaces). In this paper we provide a proof and discuss the related quantitative results and applications.
KeywordsAlgorithmic randomness Randomness conservation Layerwise computability Image randomness
We are grateful to our colleagues in ESCAPE group (LIRMM, Montpellier), Kolmogorov seminar (Moscow), and the participants of Singapore and Heidelberg workshops, especially Jason Rute, who allowed us to include his result in the paper, for interesting discussions. We also thank the anonymous referees for their comments, suggestions, and meticulous corrections.
- 3.Bienvenu, L., Romashchenko, A., Shen, A.: Sparse sets, Journées Automates Cellulaires 2008 (Uzes), 18–28. hal.archives-ouvertes.fr/hal-00274010/en/hal.archives-ouvertes.fr/hal-00274010/en/
- 5.Hoyrup, M., Rojas, C.: An Application of Martin-Löf Randomness to Effective Probability Theory, Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24. Proceedings (Lecture Notes in Computer Science, v. 5635), pp. 260-269 (2009)Google Scholar
- 6.Hoyrup, M., Rojas, C.: An Application of Effective Probability Theory to Martin-Löf Randomness, 36th International Colloquium on Automata, Languages and Programming, July 5–12. Rhodes, Greece. Proceedings (Lecture Notes in Computer Science, v. 5555), pp. 549–561 (2009)Google Scholar
- 9.Miller, J.S., Rute, J.: Energy Randomness. arXiv:1509.00524
- 10.Rumyantsev, A.: Infinite computable version of Lovasz Local Lemma, preprint. arXiv:1012.0557 (2010)