Algorithmic aspects of Lipschitz functions

DOI10.3233/COM-14025zbMATH Open1408.03031arXiv1402.2429OpenAlexW3102543632MaRDI QIDQ4979765FDOQ4979765

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)

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.

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

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

zbMATH Keywords

Lipschitz functionscomputability

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Cited In (11)

• Title not available (Why is that?)
• Algorithmic randomness and Fourier analysis
• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
• Randomness and differentiability of convex functions
• Random reals and Lipschitz continuity
• USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
• Computable Measure Theory and Algorithmic Randomness
• Lowness, Randomness, and Computable Analysis
• Highness properties close to PA completeness
• Characterization of Kurtz randomness by a differentiation theorem
• Randomness and differentiability

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)