The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways into the new model of computation; restrictions of REC(R) were proved to represent different classes of recursive functions, e.g., recursive, primitive recursive and elementary functions, and structures such as the Ritchie and the Grzergorczyk hierarchies. The class of real recursive functions was then stratified in a natural way, and REC(R) and the analytic hierarchy were recently recognised as two faces of the same mathematical concept. In this new article, we bring a strong foundational support to the Real Recursive Function Theory, rooted in Mathematical Analysis, in a way that the reader can easily recognise both its intrinsic mathematical beauty and its extreme simplicity. The new paradigm is now robust and smooth enough to be taught. To achieve such a result some concepts had to change and some new results were added.
Additional Metadata
Keywords Real recursive functions, Infinite limits, Differential recursion, Computability on reals
MSC Computability and recursion theory (msc 03Dxx), Models of computation (Turing machines, etc.) (msc 68Q05), rings, etc.), measurable sets, Suslin sets, analytic sets (msc 28A05)
Publisher North-Holland
Journal Annals of Pure and Applied Logic
Citation
Costa, J.F, Loff Barreto, B. S, & Mycka, J. (2009). A foundation for real recursive function theory. Annals of Pure and Applied Logic, 160(3), 255–288.