Recommendations
- Maximal pairs of c.e. reals in the computably Lipschitz degrees
- Algorithmic aspects of Lipschitz functions
- Randomness and the linear degrees of computability
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- The computable Lipschitz degrees of computably enumerable sets are not dense
Cited in
(18)- Random reals as measures of natural open sets
- Lipschitz continuity of quantile functions on spaces of random variables
- Some Questions in Computable Mathematics
- scientific article; zbMATH DE number 3943806 (Why is no real title available?)
- The method of the Yu–Ding Theorem and its application
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Bounded Turing reductions and data processing inequalities for sequences
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Some remarks on the continuity of random fields on Lipschitz spaces
- The computable Lipschitz degrees of computably enumerable sets are not dense
- Maximal pairs of c.e. reals in the computably Lipschitz degrees
- Algorithmic aspects of Lipschitz functions
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Randomness and the linear degrees of computability
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- Non-low\(_2\)-ness and computable Lipschitz reducibility
- Working with strong reducibilities above totally -c.e. and array computable degrees
- On the strongly bounded Turing degrees of the computably enumerable sets
This page was built for publication: Random reals and Lipschitz continuity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422017)
