Imagen de Portada
Código QR

RANDOMNESS, RELATIVIZATION AND TURING DEGREES.

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin­Löf random relative to &0slash;(). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incom...

Descripción completa

Publicado en:Journal of Symbolic Logic Vol. 70; no. 2; pp. 515 - 536
Autores principales: Nies, André, Stephan, Frank, Terwijn, Sebastian A.
Formato: Artículo
Publicado: Cambridge University Press Jun2005
Materias:
Mathematical logic
Mathematical analysis
Random sets
Set theory
Computable functions
Recursion theory
Computational mathematics
Acceso en línea:Ver este registro en EBSCOhost