Computability of probability measures and Martin-Lof randomness over metric spaces

Simple item page
dc.creatorHoyrup, Mathieu
dc.creatorRojas, Cristobal
dc.date2007-09-06
dc.date2008-07-23
dc.date.accessioned2026-07-07T09:51:56Z
dc.date.available2026-07-07T09:51:56Z
dc.descriptionIn 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).
dc.description29 pages
dc.identifierhttps://arxiv.org/abs/0709.0907
dc.identifierhttp://arxiv.org/abs/0709.0907
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165418
dc.subjectInformation Theory
dc.titleComputability of probability measures and Martin-Lof randomness over metric spaces
dc.typetext

Files

Collections

arXiv