An application of Martin-Löf randomness to effective probability theory

28Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we provide a framework for computable analysis of measure, probability and integration theories. We work on computable metric spaces with computable Borel probability measures. We introduce and study the framework of layerwise computability which lies on Martin-Löf randomness and the existence of a universal randomness test. We then prove characterizations of effective notions of measurability and integrability in terms of layerwise computability. On the one hand it gives a simple way of handling effective measure theory, on the other hand it provides powerful tools to study Martin-Löf randomness, as illustrated in a sequel paper. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hoyrup, M., & Rojas, C. (2009). An application of Martin-Löf randomness to effective probability theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 260–269). https://doi.org/10.1007/978-3-642-03073-4_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free