Computing with polynomial ordinary differential equations
From MaRDI portal
Publication:306694
DOI10.1016/J.JCO.2016.05.002zbMath1474.68151arXiv1601.05683OpenAlexW2347853400MaRDI QIDQ306694
Olivier Bournez, Amaury Pouly, Daniel Silva Graça
Publication date: 1 September 2016
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.05683
Analysis of algorithms and problem complexity (68Q25) General theory for ordinary differential equations (34A99) Computation over the reals, computable analysis (03D78) Classical models of computation (Turing machines, etc.) (68Q04)
Related Items (3)
Characterizing time computational complexity classes with polynomial differential equations ⋮ On the functions generated by the general purpose analog computer ⋮ A Universal Ordinary Differential Equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational bounds on polynomial differential equations
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Recursion theory on the reals and continuous-time computation
- Analog computers and recursive functions over the reals.
- The differential analyzer. A new machine for solving differential equations
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Some recent developments on Shannon's General Purpose Analog Computer
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Building Infinite Machines
- Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
- Mathematical Theory of the Differential Analyzer
This page was built for publication: Computing with polynomial ordinary differential equations
