On the Complexity of Real Functions
<|reference_start|>On the Complexity of Real Functions: 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.<|reference_end|>
@article{braverman2005on,
    title={On the Complexity of Real Functions},
    author={Mark Braverman},
    journal={arXiv preprint arXiv:cs/0502066},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0502066},
    primaryClass={cs.CC cs.NA math.NA}
}