A random degree with strong minimal cover

DOI10.1112/blms/bdm074zbMath1152.03034OpenAlexW2144090997MaRDI QIDQ5427824

Andrew E. M. Lewis

Publication date: 27 November 2007

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/bdm074

zbMATH Keywords

random degreestrong minimal coverTuring complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)

Related Items (2)

On a question of Slaman and Groszek ⋮ Measure and cupping in the Turing degrees

This page was built for publication: A random degree with strong minimal cover