Differential recursion

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We present a redevelopment of the theory of real-valued recursive functions that was introduced by C. Moore in 1996 by analogy with the standard formulation of the integer-valued recursive functions. While his work opened a new line of research on analog computation, the original paper contained some technical inaccuracies. We discuss possible attempts to remove the ambiguity in the behavior of the operators on partial functions, with a focus on his "primitive recursive" functions generated by the differential recursion operator that solves initial value problems. Under a reasonable reformulation, the functions in this class are shown to be analytic and computable in a strong sense in computable analysis. Despite this well-behavedness, the class turns out to be too big to have the originally purported relation to differentially algebraic functions, and hence to C. E. Shannon's model of analog computation.

Original languageEnglish
Article number22
JournalACM Transactions on Computational Logic
Volume10
Issue number3
DOIs
Publication statusPublished - Apr 1 2009
Externally publishedYes

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)
  • Logic
  • Computational Mathematics

Cite this