Imagen de Portada
Código QR

ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY.

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every 2-random sequence forms a minimal pair in the Turing degree...

Descripción completa

Publicado en:Journal of Symbolic Logic Vol. 84; no. 1; pp. 393 - 408
Autores principales: BIENVENU, LAURENT, PORTER, CHRISTOPHER P.
Formato: Artículo
Publicado: Cambridge University Press Mar2019
Materias:
Algorithmic randomness
Mathematical notation
Unsolvability (Mathematical logic)
Binary operations
Random sets
Acceso en línea:Ver este registro en EBSCOhost