Type-2 computability and Moore's recursive functions

Akitoshi Kawamura

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)83-95
Number of pages13
JournalElectronic Notes in Theoretical Computer Science
Volume120
Issue numberSPEC. ISS.
DOIs
Publication statusPublished - Feb 3 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Type-2 computability and Moore's recursive functions'. Together they form a unique fingerprint.

Cite this