Algorithmic aspects of Lipschitz functions
From MaRDI portal
Abstract: We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differentiable at z. Beyond these principal results, we show that a real z is Schnorr random if and only if every Lipschitz function with -computable derivative is differentiable at z.
Recommendations
Cited in
(14)- Characterization of Kurtz randomness by a differentiation theorem
- Algorithmic randomness and Fourier analysis
- Highness properties close to PA completeness
- Lowness, Randomness, and Computable Analysis
- Randomness and differentiability of convex functions
- Random reals and Lipschitz continuity
- Randomness and differentiability
- scientific article; zbMATH DE number 1222580 (Why is no real title available?)
- Computable Measure Theory and Algorithmic Randomness
- LUZIN’S (N) AND RANDOMNESS REFLECTION
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- scientific article; zbMATH DE number 7204482 (Why is no real title available?)
- Using almost-everywhere theorems from analysis to study randomness
- Algorithmic randomness and the weak merging of computable probability measures
This page was built for publication: Algorithmic aspects of Lipschitz functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979765)
