Working with strong reducibilities above totally -c.e. and array computable degrees
From MaRDI portal
(Redirected from Publication:5189151)
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
Recommendations
Cites work
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
- Algorithmic randomness and complexity.
- Approximation representations for reals and their wtt‐degrees
- Bounded Immunity and Btt-Reductions
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classifying model-theoretic properties
- Computability and randomness
- Computability Results Used in Differential Geometry
- Every sequence is reducible to a random one
- scientific article; zbMATH DE number 4172959 (Why is no real title available?)
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 4118353 (Why is no real title available?)
- scientific article; zbMATH DE number 1834658 (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?)
- Hypersimplicity and semicomputability in the weak truth table degrees
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Logical Approaches to Computational Barriers
- Logical Approaches to Computational Barriers
- On the construction of effectively random sets
- Post's Programme for the Ershov Hierarchy
- Random reals and Lipschitz continuity
- Randomness and recursive enumerability
- Randomness and reducibility
- Randomness and the linear degrees of computability
- The atomic model theorem and type omitting
- The ibT degrees of computably enumerable sets are not dense
- Theory and Applications of Models of Computation
- There is no SW-complete c.e. real
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- Turing degrees of reals of positive effective packing dimension
- Π10 classes and strong degree spectra of relations
Cited in
(17)- A c.e. weak truth table degree which is array noncomputable and r-maximal
- Non-low\(_2\)-ness and computable Lipschitz reducibility
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Reductions between types of numberings
- Bounded randomness
- On the strongly bounded Turing degrees of the computably enumerable sets
- A Note on the Differences of Computably Enumerable Reals
- Hierarchy of Computably Enumerable Degrees II
- A hierarchy of computably enumerable degrees
- Maximality and collapse in the hierarchy of -c.a. degrees
- Theory and Applications of Models of Computation
- Maximal pairs of c.e. reals in the computably Lipschitz degrees
- Lowness for bounded randomness
- Extending CL-reducibility on array noncomputable degrees
- Computing halting probabilities from other halting probabilities
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
This page was built for publication: Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189151)
