MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS.

Algorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ɷ ([2] and [8]). In this paper we use the probability theory of closed set-valued random variables (RACS) to ex...

Descripción completa

Detalles Bibliográficos

Publicado en:	Journal of Symbolic Logic Vol. 80; no. 2; pp. 359 - 384
Autor principal:	AXON, LOGAN M.
Formato:	Artículo
Publicado:	Cambridge University Press Jun2015
Materias:	Algorithms Set theory Probability theory Random variables Topological spaces
Acceso en línea:	Ver este registro en EBSCOhost