Type-2 Computability and Moore's Recursive Functions

Authors:
Akitoshi Kawamura
Affiliations:
Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 3
Cited 3

Recursion theory on the reals and continuous-time computation

Theoretical Computer Science - Special issue on real numbers and computers
Computable analysis: an introduction

Computable analysis: an introduction
The Complexity of Real Recursive Functions

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation

(Short) Survey of Real Hypercomputation

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Differential recursion

ACM Transactions on Computational Logic (TOCL)
Abstract geometrical computation 3: black holes for classical and analog computing

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regarding effectivity of functions on the reals, there have been several proposed models of analog, continuous-time computation, as opposed to the digital, discrete nature of the type-2 computability. We study one of them, Moore's real (primitive) recursive functions, whose definition mimics the classical characterization of recursive functions on N by the closure properties. We show that the class of type-2 computable real functions falls between Moore's classes of primitive recursive and recursive functions.