Characterizing Computable Analysis with Differential Equations

DOI10.1016/J.ENTCS.2008.12.004MaRDI QIDQ4918002zbMATH OpenOpenAlexFDO

Authors Manuel Lameiras Campagnolo, Kerry Ojakian

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.12.004

zbMATH Keywords

differential equationscomputable analysisreal recursive functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Turing machines and related notions (03D10)

Recommendations

• Computability of Differential Equations
• A characterization of computable analysis on unbounded domains using differential equations
• scientific article; zbMATH DE number 1377661
• Computability of ordinary differential equations
• Computability and incomputability of differential equations
• Computability aspects for 1st-order partial differential equations via characteristics
• Computability with polynomial differential equations
• Computable analysis with applications to dynamic systems
• On the computational complexity of ordinary differential equations

Cites work

• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• A Survey of Transcendentally Transcendental Functions
• A survey on continuous time computations
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• An analog characterization of the Grzegorczyk hierarchy
• Analog computers and recursive functions over the reals.
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Iteration, inequalities, and differentiability in analog computers
• 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
• Some recent developments on Shannon's General Purpose Analog Computer
• The elementary computable functions over the real numbers: applying two new techniques
• Using Approximation to Relate Computational Classes over the Reals

Cited in

(9)

• A new characterization of computable functions
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• A characterization of computable analysis on unbounded domains using differential equations
• A survey of recursive analysis and Moore's notion of real computation
• Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL
• Automata, Languages and Programming
• Recursive analysis of singular ordinary differential equations
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• scientific article; zbMATH DE number 7453165 (Why is no real title available?)

This page was built for publication: Characterizing Computable Analysis with Differential Equations

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