Complexity Theory of Real Functions pp 190-214 | Cite as

# Differentiation

## Abstract

Computing the derivative of a function is difficult because, intuitively, the derivative depends on the local subtle changes of the function and is hard to compute from the approximation of the function. However, if some nice properties about the function is known (such as the differentiability of the derivative itself) then the derivative may be easy to compute. Formally, we prove that the derivative of a polynomial-time computable function is polynomial-time computable if and only if it has a polynomial modulus of continuity. Conversely, we can construct a function / in *P*_{ C }_{[0,1]} such that its derivative exists everywhere but is not computable.

## Keywords

Power Series Bounded Variation Modulus Function Computable Function Absolute Continuity## Preview

Unable to display preview. Download preview PDF.