On the Complexity of Real Functions

Simple item page
dc.creatorBraverman, Mark
dc.date2005-02-15
dc.date.accessioned2026-07-07T03:22:32Z
dc.date.available2026-07-07T03:22:32Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0502066
dc.identifierhttp://arxiv.org/abs/cs/0502066
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32634
dc.subjectComputational Complexity
dc.subjectNumerical Analysis
dc.subjectF. 1.1; F. 4. 1
dc.titleOn the Complexity of Real Functions
dc.typetext

Files

Collections

arXiv