On the Complexity of Real Functions
Computational Complexity
2007-05-23 v1 Numerical Analysis
Numerical Analysis
Abstract
We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS computability [Blum, Cucker, Shub, Smale 1998], and bit computability in the tradition of computable analysis [Weihrauch 2000] as it relies on the latter but allows some discontinuities and multiple values.
Cite
@article{arxiv.cs/0502066,
title = {On the Complexity of Real Functions},
author = {Mark Braverman},
journal= {arXiv preprint arXiv:cs/0502066},
year = {2007}
}