Strong jump-traceability. I: The computably enumerable case
From MaRDI portal
Publication:2474313
Recommendations
- Inherent enumerability of strong jump-traceability
- Strong jump-traceability. II: K-triviality
- Characterizing the strongly jump-traceable sets via randomness
- Jumps of computably enumerable equivalence relations
- Strong jump-traceability and Demuth randomness
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- On strongly jump traceable reals
- New Computational Paradigms
- A random set which only computes strongly jump-traceable c.e. sets
- On the strongly bounded Turing degrees of the computably enumerable sets
Cites work
- A Refinement of Lown and Highn for the R.E. Degrees
- A variant of the Kolmogorov concept of complexity
- Algorithmic randomness and complexity.
- Calibrating Randomness
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Computability and randomness
- Computational randomness and lowness
- scientific article; zbMATH DE number 5354044 (Why is no real title available?)
- scientific article; zbMATH DE number 3489017 (Why is no real title available?)
- scientific article; zbMATH DE number 2063218 (Why is no real title available?)
- Information-theoretic characterizations of recursive infinite strings
- Lowness and nullsets
- Lowness for the class of random sets
- Lowness for the Class of Schnorr Random Reals
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Non-cupping and randomness
- On initial segment complexity and degrees of randomness
- Process complexity and effective random tests
- Randomness and Computability: Open Questions
- Reals which compute little
- Recursively enumerable sets and degrees
- Schnorr randomness
- Strong jump-traceability. II: K-triviality
- Using random sets as oracles
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(27)- Time-bounded Kolmogorov complexity and Solovay functions
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Lowness properties and approximations of the jump
- Randomness, computation and mathematics
- A random set which only computes strongly jump-traceable c.e. sets
- Benign cost functions and lowness properties
- Beyond strong jump traceability
- Strengthening prompt simplicity
- Cupping with random sets
- MASS PROBLEMS AND HYPERARITHMETICITY
- Lowness for Demuth Randomness
- 𝐾-trivial degrees and the jump-traceability hierarchy
- 2009 North American Annual Meeting of the Association for Symbolic Logic
- Strong jump-traceability. II: K-triviality
- A \(K\)-trivial set which is not jump traceable at certain orders
- Computably enumerable sets below random sets
- Characterizing the strongly jump-traceable sets via randomness
- Strong jump-traceability
- On arithmetical level of the class of superhigh sets
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
- Reals which compute little
- Inherent enumerability of strong jump-traceability
- Upper bounds on ideals in the computably enumerable Turing degrees
- A semilattice generated by superlow computably enumerable degrees
- Martin-Löf reducibility and cost functions
- On strongly jump traceable reals
- Superhighness
This page was built for publication: Strong jump-traceability. I: The computably enumerable case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474313)
