On very high degrees

DOI10.2178/jsl/1208358755zbMath1168.03031OpenAlexW2063564115MaRDI QIDQ5387314

Keng Meng Ng

Publication date: 8 May 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1208358755

zbMATH Keywords

minimal pairr.e. degree

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

Splitting into degrees with low computational strength ⋮ STRONG JUMP-TRACEABILITY ⋮ A superhigh diamond in the c.e. tt-degrees ⋮ Bounded-low sets and the high/low hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information-theoretic characterizations of recursive infinite strings
• Lowness properties and randomness
• Completing pseudojump operators
• A Cappable Almost Everywhere Dominating Computably Enumerable Degree
• Almost everywhere domination and superhighness
• Low for random reals and positive-measure domination
• Using random sets as oracles
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: On very high degrees