Handbook of logic in computer science (vol. 3)
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
Feasible real random access machines
Journal of Complexity
Computable analysis: an introduction
Computable analysis: an introduction
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
A denotational semantics for total correctness of sequential exact real programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
| Hi-index | 0.03 |
J. Raymundo Marcial---Romero and M. H. Escardó described a functional programming language with an abstract data type Real for the real numbers and a non-deterministic operator . We show that this language is universal at first order, as conjectured by these authors: all computable, first-order total functions on the real numbers are definable. To be precise, we show that each computable function $f\colon\mathbb{R}\to\mathbb{R}$ we consider is the extension of the denotation of some program , in a model based on powerdomains, described in previous work. Whereas this semantics is only an approximate one, in the sense that programs may have a denotation strictly below their true outputs, our result shows that, to compute a given function, it is in fact always possible to find a program with a faithful denotation. We briefly indicate how our proof extends to show that functions taken from a large class of computable, first-order partial functions in several arguments are definable.