Strong jump-traceability
From MaRDI portal
Publication:4580033
Recommendations
Cites work
- scientific article; zbMATH DE number 4172959 (Why is no real title available?)
- scientific article; zbMATH DE number 5354051 (Why is no real title available?)
- scientific article; zbMATH DE number 3821726 (Why is no real title available?)
- scientific article; zbMATH DE number 4053595 (Why is no real title available?)
- scientific article; zbMATH DE number 3995657 (Why is no real title available?)
- scientific article; zbMATH DE number 841084 (Why is no real title available?)
- scientific article; zbMATH DE number 1421074 (Why is no real title available?)
- A Cappable Almost Everywhere Dominating Computably Enumerable Degree
- A \(K\)-trivial set which is not jump traceable at certain orders
- Additivity of Measure Implies Additivity of Category
- Algorithmic Information Theory
- Algorithmic randomness and measures of complexity
- Almost everywhere domination and superhighness
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- An almost deep degree
- Anti-complex sets and reducibilities with tiny use
- Benign cost functions and lowness properties
- Beyond strong jump traceability
- Characterizing lowness for Demuth randomness
- Characterizing the strongly jump-traceable sets via randomness
- Coherent randomness tests and computing the \(K\)-trivial sets
- Completing pseudojump operators
- Computability and randomness
- Computably enumerable sets below random sets
- Computational randomness and lowness
- Computuing \(K\)-trivial sets by incomplete random sets
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Demuth randomness and computational complexity
- Density, forcing, and the covering problem
- Information-theoretic characterizations of recursive infinite strings
- Inherent enumerability of strong jump-traceability
- Lowness for the Class of Schnorr Random Reals
- Lowness notions, measure and domination
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- On relative randomness
- On strongly jump traceable reals
- On very high degrees
- Promptness does not imply superlow cuppability
- Pseudo Jump Operators. I: The R. E. Case
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Randomness and Computability: Open Questions
- Strong jump-traceability and Demuth randomness
- Strong jump-traceability. I: The computably enumerable case
- Strong jump-traceability. II: K-triviality
- The Degrees of Hyperimmune Sets
- Time-Bounded Kolmogorov Complexity and Solovay Functions
- Using random sets as oracles
- đŸ-trivial degrees and the jump-traceability hierarchy
Cited in
(11)- Hierarchy of Computably Enumerable Degrees II
- Strong jump inversion
- Martin-Löf reducibility and cost functions
- Superhighness and Strong Jump Traceability
- Computing from projections of random points
- Beyond strong jump traceability
- Lowness properties and approximations of the jump
- Strong jump-traceability and Demuth randomness
- Inherent enumerability of strong jump-traceability
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Strong jump-traceability. II: K-triviality
This page was built for publication: Strong jump-traceability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580033)
