Maximal pairs of c.e. reals in the computably Lipschitz degrees
DOI10.1016/J.APAL.2010.10.003zbMATH Open1252.03102OpenAlexW2067566981MaRDI QIDQ638499FDOQ638499
Publication date: 12 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2010.10.003
Recommendations
\(P_{n,h,s}^{\alpha}\)-procedure\(P_{n,k}\)-procedurecomputably Lipschitz reducibilitymaximal pairs of c.e. realsmeasure of relative randomness
Algorithmic randomness and dimension (03D32) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- Randomness and the linear degrees of computability
- Computability Theory and Differential Geometry
- The ibT degrees of computably enumerable sets are not dense
- Random reals and Lipschitz continuity
- The method of the Yu–Ding Theorem and its application
- Title not available (Why is that?)
- Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
- There is no SW-complete c.e. real
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
Cited In (7)
- Local characterization of block covers and their applications
- Random reals and Lipschitz continuity
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Randomness and the linear degrees of computability
- Non-low\(_2\)-ness and computable Lipschitz reducibility
- On the strongly bounded Turing degrees of the computably enumerable sets
This page was built for publication: Maximal pairs of c.e. reals in the computably Lipschitz degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638499)
