A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE.
Recently, a connection has been established between two branches of computability theory, namely between algorithmic randomness and algorithmic learning theory. Learning-theoretical characterizations of several notions of randomness were discovered. We study such characterizations based on the asymp...
| Publicado en: | Review of Symbolic Logic Vol. 15; no. 3; pp. 807 - 823 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Sep2022
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |