Measure and cupping in the Turing degrees
From MaRDI portal
Publication:2845877
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- scientific article; zbMATH DE number 841084 (Why is no real title available?)
- A 1-generic degree with a strong minimal cover
- A random degree with strong minimal cover
- Algorithmic randomness and complexity.
- Computability and randomness
- Degrees of Unsolvability. (AM-55)
- Jump inversions inside effectively closed sets and applications to randomness
- On degrees of recursive unsolvability
- Strong minimal covers and a question of Yates: the story so far
- The definition of random sequences
- Π10 classes, strong minimal covers and hyperimmune-free degrees
Cited in
(3)
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)