Strong jump-traceability
From MaRDI portal
Publication:4580033
DOI10.1017/BSL.2017.38OpenAlexW2885370573WikidataQ129422294 ScholiaQ129422294MaRDI QIDQ4580033FDOQ4580033
Authors: Noam Greenberg, Dan Turetsky 
Publication date: 13 August 2018
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/bsl.2017.38
Recommendations
Algorithmic randomness and dimension (03D32) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)
Cites Work
- Computability and randomness
- Lowness properties and randomness
- Computational randomness and lowness
- Coherent randomness tests and computing the \(K\)-trivial sets
- Algorithmic randomness and measures of complexity
- Lowness notions, measure and domination
- Lowness for the Class of Schnorr Random Reals
- The Degrees of Hyperimmune Sets
- Title not available (Why is that?)
- Additivity of Measure Implies Additivity of Category
- Information-theoretic characterizations of recursive infinite strings
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Completing pseudojump operators
- Benign cost functions and lowness properties
- Randomness and Computability: Open Questions
- Pseudo Jump Operators. I: The R. E. Case
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Strong jump-traceability. II: \(K\)-triviality
- Title not available (Why is that?)
- Characterizing the strongly jump-traceable sets via randomness
- Almost everywhere domination and superhighness
- Demuth randomness and computational complexity
- On strongly jump traceable reals
- Title not available (Why is that?)
- Degrees of members of \(\Pi_ 1^ 0\) classes
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Characterizing lowness for Demuth randomness
- Time-Bounded Kolmogorov Complexity and Solovay Functions
- A \(K\)-trivial set which is not jump traceable at certain orders
- Computuing \(K\)-trivial sets by incomplete random sets
- Title not available (Why is that?)
- Computably enumerable sets below random sets
- Title not available (Why is that?)
- Using random sets as oracles
- đŸ-trivial degrees and the jump-traceability hierarchy
- Title not available (Why is that?)
- Strong jump-traceability and Demuth randomness
- Inherent enumerability of strong jump-traceability
- Anti-complex sets and reducibilities with tiny use
- Algorithmic Information Theory
- On very high degrees
- On relative randomness
- Beyond strong jump traceability
- A Cappable Almost Everywhere Dominating Computably Enumerable Degree
- An almost deep degree
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Density, forcing, and the covering problem
- Promptness does not imply superlow cuppability
- Title not available (Why is that?)
Cited In (11)
- Martin-Löf reducibility and cost functions
- Strong jump inversion
- 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
- Hierarchy of Computably Enumerable Degrees II
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)
