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.
Feb 15, 2005
It follows from Theorem 6 that these functions are graph computable. So graph-computability extends the modified. BSS function computability on “nice” domains.
People also ask
What is the complexity of function?
What is the condition for real function?
Abstract: We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the ...
We investigate the computational complexity of real functions using the methods of recursive function theory. Partial recursive real functions are defined and ...
This work establishes a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the ...
People also search for
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable ...
Free 2–7 day delivery 7-day returns
Polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms.
We argue that this notion is very natural when one tries to determine just how difficult a certain function is for a very rich class of 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 reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, l, ...