A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS.

Numerous learning tasks can be described as the process of extrapolating patterns from observed data. One of the driving intuitions behind the theory of algorithmic randomness is that randomness amounts to the absence of any effectively detectable patterns: it is thus natural to regard randomness as...

Descripción completa

Detalles Bibliográficos

Publicado en:	Review of Symbolic Logic Vol. 14; no. 2; pp. 531 - 550
Autor principal:	BLANDO, FRANCESCA ZAFFORA
Formato:	Artículo
Publicado:	Cambridge University Press Jun2021
Materias:	Algorithmic randomness Self-expression Kolmogorov complexity Acquisition of data Computable functions
Acceso en línea:	Ver este registro en EBSCOhost