Strong jump-traceability. II: K-triviality
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2063218 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Almost everywhere domination
- Almost everywhere domination and superhighness
- Benign cost functions and lowness properties
- Calibrating Randomness
- Characterizing the strongly jump-traceable sets via randomness
- Completing pseudojump operators
- Complexity and randomness
- Computability and randomness
- Computational randomness and lowness
- Demuth randomness and computational complexity
- Kolmogorov complexity and solovay functions
- Lowness for the Class of Schnorr Random Reals
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- On strongly jump traceable reals
- Pseudo Jump Operators. I: The R. E. Case
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Randomness and Computability: Open Questions
- Strong jump-traceability. I: The computably enumerable case
Cited in
(16)- On strongly jump traceable reals
- Time-bounded Kolmogorov complexity and Solovay functions
- Martin-Löf reducibility and cost functions
- Lowness for Demuth Randomness
- đŸ-trivial degrees and the jump-traceability hierarchy
- Beyond strong jump traceability
- K-Trivial Closed Sets and Continuous Functions
- Strong jump-traceability. I: The computably enumerable case
- Computably enumerable sets below random sets
- Inherent enumerability of strong jump-traceability
- Lowness for effective Hausdorff dimension
- Superhighness
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Strong jump-traceability
- Cupping with random sets
- Characterizing the strongly jump-traceable sets via randomness
This page was built for publication: Strong jump-traceability. II: \(K\)-triviality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375805)
