A characterization of computable analysis on unbounded domains using differential equations

DOI10.1016/J.IC.2011.04.002MaRDI QIDQ719239zbMATH OpenOpenAlexFDO

Authors Kerry Ojakian, Manuel Lameiras Campagnolo

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

differential equationsapproximationcomputable analysisanalog computationfunction algebrasreal recursive functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Recommendations

• Characterizing Computable Analysis with Differential Equations
• Automata, Languages and Programming
• Recursive analysis characterized as a class of real recursive functions
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• New Computational Paradigms

Cites work

• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3204015 (Why is no real title available?)
• A domain-theoretic approach to computability on the real line
• A foundation for real recursive function theory
• A survey on continuous time computations
• An analog characterization of the Grzegorczyk hierarchy
• Analog computers and recursive functions over the reals.
• Characterizing Computable Analysis with Differential Equations
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Computable functionals
• Differential recursion
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Feasible real random access machines
• Mathematical Theory of the Differential Analyzer
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Recursion theory on the reals and continuous-time computation
• Recursive analysis characterized as a class of real recursive functions
• Recursive characterization of computable real-valued functions and relations
• The elementary computable functions over the real numbers: applying two new techniques
• Using Approximation to Relate Computational Classes over the Reals

Cited in

(4)

• A new characterization of computable functions
• Characterizing Computable Analysis with Differential Equations
• Dynamic analysis of unbounded domains by a reduced set of base functions
• Recursive analysis characterized as a class of real recursive functions

This page was built for publication: A characterization of computable analysis on unbounded domains using differential equations

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