Measure and cupping in the Turing degrees

DOI10.1090/S0002-9939-2012-11183-9zbMATH Open1294.03031OpenAlexW2038238641MaRDI QIDQ2845877FDOQ2845877

George Barmpalias, Andrew E. M. Lewis

Publication date: 3 September 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2012-11183-9

Recommendations

• The typical Turing degree
• A random degree with strong minimal cover
• Finite cupping sets
• A minimal pair joining to a plus cupping Turing degree
• An almost-universal cupping degree

zbMATH Keywords

Turing degreesstrong minimal cover2-random degreecupping property

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Other Turing degree structures (03D28)

Cites Work

• Algorithmic Randomness and Complexity
• Computability and randomness
• The definition of random sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strong minimal covers and a question of Yates: the story so far
• On degrees of recursive unsolvability
• Jump inversions inside effectively closed sets and applications to randomness
• Degrees of Unsolvability. (AM-55)
• A 1-generic degree with a strong minimal cover
• Π10 classes, strong minimal covers and hyperimmune-free degrees
• A random degree with strong minimal cover

Cited In (3)

• A random degree with strong minimal cover
• Finite cupping sets
• Jug measuring: algorithms and complexity

This page was built for publication: Measure and cupping in the Turing degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845877)