Algorithmic aspects of Lipschitz functions

DOI10.3233/COM-14025MaRDI QIDQ4979765zbMATHOpenAlexFDO

Authors Bjørn Kjos-Hanssen, André Nies, Cameron E. Freer, Frank Stephan

Publication date 19 June 2014

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.2429

zbMATH Keywords

Lipschitz functionscomputability

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

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 $L_1$-computable derivative is differentiable at z.

Recommendations

• Randomness and differentiability
• Randomness and differentiability of convex functions
• Differentiability of polynomial time computable functions
• Random reals and Lipschitz continuity
• scientific article; zbMATH DE number 7204482

Cited in

(11)

• Algorithmic randomness and Fourier analysis
• Randomness and differentiability of convex functions
• Lowness, Randomness, and Computable Analysis
• Highness properties close to PA completeness
• Characterization of Kurtz randomness by a differentiation theorem
• Random reals and Lipschitz continuity
• scientific article; zbMATH DE number 1222580 (Why is no real title available?)
• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
• Using almost-everywhere theorems from analysis to study randomness
• Randomness and differentiability
• Computable Measure Theory and Algorithmic Randomness

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)