Algorithmic Aspects of Lipschitz Functions

@article{Freer2014AlgorithmicAO,
  title={Algorithmic Aspects of Lipschitz Functions},
  author={Cameron E. Freer and Bj{\o}rn Kjos-Hanssen and Andr{\'e} Nies and Frank Stephan},
  journal={Computability},
  year={2014},
  volume={3},
  pages={45-61}
}
  • Cameron E. Freer, Bjørn Kjos-Hanssen, +1 author Frank Stephan
  • Published 2014
  • Mathematics, Computer Science
  • Computability
  • We characterize the variation functions of computable Lipschitz functions. We show that a realz 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 L1-computable derivative is differentiable at z. 

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 21 CITATIONS

    FILTER CITATIONS BY YEAR

    2012
    2019

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 43 REFERENCES

    Randomness and Differentiability

    VIEW 2 EXCERPTS

    Differentiability of polynomial time computable functions

    VIEW 1 EXCERPT

    Lectures on Lipschitz analysis

    VIEW 1 EXCERPT

    Computability in analysis and physics

    Real and Complex Analysis

    Algorithmic Randomness and Complexity

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL