Differential recursion

DOI10.1145/1507244.1507252MaRDI QIDQ2946580zbMATH OpenOpenAlexFDO

Authors Akitoshi Kawamura

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.0301

zbMATH Keywords

initial value problemsanalog computationreal recursive functionsdifferentially algebraic functionstranscendentally transcendental functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Abstract: Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some technical inaccuracies. Focusing on his "primitive recursive" functions, we pin down what is problematic and discuss possible attempts to remove the ambiguity regarding the behavior of the differential recursion operator on partial functions. It turns out that in any case the purported relation to differentially algebraic functions, and hence to Shannon's model of analog computation, fails.

Recommendations

• A survey of recursive analysis and Moore's notion of real computation
• A foundation for real recursive function theory
• Real recursive functions and their hierarchy
• Analog computers and recursive functions over the reals.
• Recursion theory on the reals and continuous-time computation

Cited in

(5)

• A recursive algorithm for optimizing differentiation
• A characterization of computable analysis on unbounded domains using differential equations
• A survey of recursive analysis and Moore's notion of real computation
• A foundation for real recursive function theory
• Recursive analysis of singular ordinary differential equations

This page was built for publication: Differential recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946580)