LEBESGUE DENSITY AND $\prod _1^0$ CLASSES.

Analyzing the effective content of the Lebesgue density theorem played a crucial role in some recent developments in algorithmic randomness, namely, the solutions of the ML-covering and ML-cupping problems. Two new classes of reals emerged from this inquiry: the positive density points with respect...

Descripción completa

Detalles Bibliográficos

Publicado en:	Journal of Symbolic Logic Vol. 81; no. 1; pp. 80 - 96
Autor principal:	KHAN, MUSHFEQ
Formato:	Artículo
Publicado:	Cambridge University Press Mar2016
Materias:	Algorithmic randomness Mathematics theorems Algorithms Random effects model Computable functions
Acceso en línea:	Ver este registro en EBSCOhost