Computability of ordinary differential equations

DOI10.1007/978-3-319-94418-0_21MaRDI QIDQ1670741zbMATH OpenOpenAlexFDO

Authors Ning Zhong, Daniel Graça

Publication date 6 September 2018

Full work available at URL http://hdl.handle.net/10400.1/10882

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12)

Recommendations

• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Computability with polynomial differential equations
• A new view of the computational complexity of IVP for ODE
• Computational bounds on polynomial differential equations
• scientific article; zbMATH DE number 1377661

Cited in

(13)

• A rigorous ODE solver and Smale's 14th problem
• A new view of the computational complexity of IVP for ODE
• Computability with polynomial differential equations
• On the computational complexity of ordinary differential equations
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Computability and incomputability of differential equations
• scientific article; zbMATH DE number 1377661 (Why is no real title available?)
• Characterizing Computable Analysis with Differential Equations
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Computability of Differential Equations
• Computability of solutions of operator equations
• Recursive analysis of singular ordinary differential equations
• Axiomatization of compact initial value problems: open properties

This page was built for publication: Computability of ordinary differential equations

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