Computability with polynomial differential equations

DOI10.1016/J.AAM.2007.02.003MaRDI QIDQ2482915zbMATH OpenOpenAlexFDO

Authors Jorge Buescu, Daniel Graça, Manuel Lameiras Campagnolo

Publication date 28 April 2008

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12)

Recommendations

• Computational bounds on polynomial differential equations
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
• Computability of ordinary differential equations
• Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
• Computing with polynomial ordinary differential equations

Cites work

• A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
• A family of universal recurrent networks
• 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.
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Computability with low-dimensional dynamical systems
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• scientific article; zbMATH DE number 1687056 (Why is no real title available?)
• scientific article; zbMATH DE number 45971 (Why is no real title available?)
• scientific article; zbMATH DE number 3484411 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 2013793 (Why is no real title available?)
• scientific article; zbMATH DE number 766966 (Why is no real title available?)
• scientific article; zbMATH DE number 3048552 (Why is no real title available?)
• scientific article; zbMATH DE number 3109695 (Why is no real title available?)
• Integration in Finite Terms
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Iteration, inequalities, and differentiability in analog computers
• Mathematical Theory of the Differential Analyzer
• New Computational Paradigms
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• On the computational power of neural nets
• Real recursive functions and their hierarchy
• The wave equation with computable initial data such that its unique solution is not computable
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Unpredictability and undecidability in dynamical systems

Cited in

(34)

• Computational bounds on polynomial differential equations
• Differential dynamic logic for hybrid systems
• Simulation of Turing machine with uEAC-computable functions
• Computability of ordinary differential equations
• On the universality of potential well dynamics
• An axiomatic approach to existence and liveness for differential equations
• Programming with ordinary differential equations: some first steps towards a programming language
• Computability and Beltrami fields in Euclidean space
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Computational complexity of solving polynomial differential equations over unbounded domains
• Computability and dynamical systems
• Differentiability of polynomial time computable functions
• Computation with perturbed dynamical systems
• Undecidable event detection problems for ODEs of dimension one and two
• scientific article; zbMATH DE number 1377661 (Why is no real title available?)
• Characterizing Computable Analysis with Differential Equations
• Boundedness of the domain of definition is undecidable for polynomial ODEs
• Turing machines can be efficiently simulated by the general purpose analog computer
• Average-case polynomial-time computability of Hamiltonian dynamics
• Computability of Differential Equations
• A universal ordinary differential equation
• Computability and computational complexity of the evolution of nonlinear dynamical systems
• New Computational Paradigms
• Characterizing time computational complexity classes with polynomial differential equations
• Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
• Looking at Euler flows through a contact mirror: universality and undecidability
• A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
• A continuous characterization of PSPACE using polynomial ordinary differential equations
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks
• Computation with real numbers and continuous-time dynamical systems
• Hydrodynamic and symbolic models of computation with advice
• Topological entropy of Turing complete dynamics
• An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable

This page was built for publication: Computability with polynomial differential equations

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