Computability of probability measures and Martin-Lof randomness over metric spaces
From MaRDI portal
Publication:6206710
DOI10.1016/J.IC.2008.12.009arXiv0709.0907MaRDI QIDQ6206710FDOQ6206710
Authors: Mathieu Hoyrup, Cristobal Rojas 
Publication date: 6 September 2007
Abstract: In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show that any computable metric space admits a universal uniform randomness test (without further assumption).
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
This page was built for publication: Computability of probability measures and Martin-Lof randomness over metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206710)
