Indifferent Sets
From MaRDI portal
Publication:3623226
DOI10.1093/logcom/exn101zbMath1165.03026OpenAlexW2913145454MaRDI QIDQ3623226
Joseph S. Miller, André Nies, Santiago Figueira
Publication date: 16 April 2009
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a9816521bdd06ac405b445f266a3aaaef217eae8
randomnesssparsenessabsolutely normal numberTuring degreehyperimmune setMartin-Löf random sequencesautoreducibilityindifferent set
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)
Related Items (5)
Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Lowness, Randomness, and Computable Analysis ⋮ The Information Content of Typical Reals ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Things that can be made into themselves
This page was built for publication: Indifferent Sets
