2000 character limit reached
Algorithmic aspects of Lipschitz functions
Published 11 Feb 2014 in math.LO and math.CA | (1402.2429v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.