Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Achilles and the tortoise climbing up the arithmetical hierarchy
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Computable analysis: an introduction
Computable analysis: an introduction
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
Subclasses of Coputable Real Valued Functions
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
µ-recursion and infinite limits
Theoretical Computer Science
Perturbed Turing Machines and Hybrid Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Infinite limits and R-recursive functions
Acta Cybernetica
Analog computers and recursive functions over the reals
Journal of Complexity
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The P ≠ NP conjecture in the context of real and complex analysis
Journal of Complexity
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
The New Promise of Analog Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The P≠NP conjecture in the context of real and complex analysis
Journal of Complexity
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to correspond to the smallest class of real functions containing some basic functions and closed by composition, linear integration and a very natural unique minimization schema.