A characterization of computable analysis on unbounded domains using differential equations

DOI10.1016/j.ic.2011.04.002zbMath1247.03097MaRDI QIDQ719239

Kerry Ojakian, Campagnolo, Manuel Lameiras

Publication date: 10 October 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.04.002

zbMATH Keywords

analog computation; approximation; differential equations; computable analysis; function algebras; real recursive functions

Mathematics Subject Classification ID

03D78: Computation over the reals, computable analysis

Cites Work

• The elementary computable functions over the real numbers: applying two new techniques
• A foundation for real recursive function theory
• A domain-theoretic approach to computability on the real line
• Feasible real random access machines
• Recursion theory on the reals and continuous-time computation
• Recursive characterization of computable real-valued functions and relations
• Analog computers and recursive functions over the reals.
• An analog characterization of the Grzegorczyk hierarchy
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Differential recursion
• Computable functionals
• Using Approximation to Relate Computational Classes over the Reals
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Characterizing Computable Analysis with Differential Equations
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Mathematical Theory of the Differential Analyzer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item