Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs

DOI10.1016/j.entcs.2008.03.007zbMath1262.34010OpenAlexW2039123074MaRDI QIDQ4918029

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

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.03.007

zbMATH Keywords

ordinary differential equationsdecidabilityinitial-value problemsmaximal interval

Mathematics Subject Classification ID

Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Undecidability and degrees of sets of sentences (03D35)

Related Items (4)

Computational complexity of solving polynomial differential equations over unbounded domains ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ An axiomatic approach to existence and liveness for differential equations ⋮ Computability of Differential Equations

Cites Work

• The wave equation with computable initial data such that its unique solution is not computable
• What's decidable about hybrid automata?
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Computability with low-dimensional dynamical systems
• Small universal Turing machines
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• On the computational power of neural nets
• Computability with polynomial differential equations
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• A computable ordinary differential equation which possesses no computable solution
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• Unpredictability and undecidability in dynamical systems
• New Computational Paradigms
• A survey of computational complexity results in systems and control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs