TY - JOUR
T1 - Type-2 computability and Moore's recursive functions
AU - Kawamura, Akitoshi
PY - 2005/2/3
Y1 - 2005/2/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=13544260579&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=13544260579&partnerID=8YFLogxK
U2 - 10.1016/j.entcs.2004.06.036
DO - 10.1016/j.entcs.2004.06.036
M3 - Article
AN - SCOPUS:13544260579
VL - 120
SP - 83
EP - 95
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
SN - 1571-0661
IS - SPEC. ISS.
ER -