Non-cupping, measure and computably enumerable splittings

DOI10.1017/S0960129508007226zbMath1170.03020OpenAlexW2080410441MaRDI QIDQ3616214

George Barmpalias, Anthony Morphett

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007226

zbMATH Keywords

LR degreenoncuppabilityalmost everywhere dominationc.e. splitting

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Universal computably enumerable sets and initial segment prefix-free complexity ⋮ Elementary differences between the degrees of unsolvability and degrees of compressibility ⋮ Tracing and domination in the Turing degrees

Cites Work

• Weak density and cupping in the d-r.e. degrees
• Completely mitotic r. e. degrees
• Logic symposia, Hakone 1979, 1980. Proceedings of Conferences Held in Hakone, Japan, March 21-24, 1979 and February 4-7, 1980
• Splitting theorems in recursion theory
• Lowness properties and randomness
• Algorithmic Randomness and Complexity
• Uniform almost everywhere domination
• Randomness, lowness and degrees
• A Completely Mitotic Nonrecursive R.E. Degree
• Mitotic recursively enumerable sets
• A Cappable Almost Everywhere Dominating Computably Enumerable Degree
• Almost everywhere domination and superhighness
• Low for random reals and positive-measure domination
• Almost everywhere domination
• Computability and Randomness
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• The Priority Method I

This page was built for publication: Non-cupping, measure and computably enumerable splittings