2005/02/15 by Mark Braverman, Braverman, Mark · 1 citation
Computer Science · Mathematics · #Computational Complexity (cs.CC) #F. 1.1 #F. 4. 1 #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA) #cs.CC #cs.NA #math.NA
paper · pdf · doi:10.48550/arxiv.cs/0502066
arxiv created 2005/02/15 · arxiv updated 2009/12/01
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.