On the Complexity of Real Functions

Details On the Complexity of Real Functions On the Complexity of Real Functions

2005-02-15

arxiv.org/abs/cs/0502066v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Real Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Real Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Real Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242524