DEEP Π CLASSES.
A set of infinite binary sequences C ⊆ 2 is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probability. The study of negligibility is of particular interest in the context of Π classes. In this paper, we introduce the notion of depth for...
| Publicado en: | Bulletin of Symbolic Logic Vol. 22; no. 2; pp. 249 - 287 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jun2016
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |