Algorithmic Aspects of Lipschitz Functions

DOI10.3233/COM-14025zbMath1408.03031arXiv1402.2429OpenAlexW3102543632MaRDI QIDQ4979765

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

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

computabilityLipschitz functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Related Items (9)

Randomness and differentiability ⋮ Randomness and Differentiability of Convex Functions ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE ⋮ Characterization of Kurtz randomness by a differentiation theorem ⋮ Lowness, Randomness, and Computable Analysis ⋮ Algorithmic randomness and Fourier analysis ⋮ Highness properties close to PA completeness ⋮ Computable Measure Theory and Algorithmic Randomness

This page was built for publication: Algorithmic Aspects of Lipschitz Functions