Effective genericity and differentiability

DOI10.4115/JLA.2014.6.4MaRDI QIDQ2930874zbMATH OpenOpenAlexFDO

Authors Rutger Kuyper, Sebastiaan A. Terwijn

Publication date 20 November 2014

Published in Journal of Logic and Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

differentiabilityBaire category1-genericity

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Classification of real functions; Baire classification of sets and functions (26A21) Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems (26A24)

Abstract: We prove that a real x is 1-generic if and only if every differentiable computable function has continuous derivative at x. This provides a counterpart to recent results connecting effective notions of randomness with differentiability. We also consider multiply differentiable computable functions and polynomial time computable functions.

Recommendations

• Randomness and differentiability
• Differentiability of polynomial time computable functions
• Randomness and differentiability of convex functions
• Relatively computable functions of real variables
• Every 1-generic computes a properly 1-generic

Cites work

• scientific article; zbMATH DE number 3678157 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3508473 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Algorithmic randomness and complexity.
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Fast Multiple-Precision Evaluation of Elementary Functions
• Invariant descriptive set theory

Cited in

(7)

• Any FIP real computes a 1-generic
• Pointwise complexity of the derivative of a computable function
• Randomness and differentiability of convex functions
• Online computability and differentiation in the Cantor space
• Cousin’s lemma in second-order arithmetic
• A Galois connection between Turing jumps and limits
• Notes on computable analysis

This page was built for publication: Effective genericity and differentiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930874)