Computability with polynomial differential equations
@article{Graa2008ComputabilityWP, title={Computability with polynomial differential equations}, author={D. Graça and M. L. Campagnolo and J. Buescu}, journal={Adv. Appl. Math.}, year={2008}, volume={40}, pages={330-349} }
In this paper, we show that there are initial value problems defined with polynomial ordinary differential equations that can simulate universal Turing machines in the presence of bounded noise. The polynomial ODE defining the IVP is explicitly obtained and the simulation is performed in real time.
Figures and Topics from this paper
55 Citations
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
- Mathematics, Computer Science
- MFCS
- 2011
- 10
- PDF
Computational bounds on polynomial differential equations
- Mathematics, Computer Science
- Appl. Math. Comput.
- 2009
- 14
- PDF
Recursive analysis of singular ordinary differential equations
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2010
- PDF
Ordinary Differential Equations & Computability
- Mathematics, Computer Science
- 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
- 2018
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
- Mathematics, Computer Science
- Electron. Notes Theor. Comput. Sci.
- 2008
- 20
- PDF
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Mathematics, Computer Science
- J. ACM
- 2017
- 18
- PDF
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk)
- Mathematics, Computer Science
- STACS
- 2020
- PDF
The Extended Analog Computer and Functions Computable in a Digital Sense
- Computer Science, Mathematics
- Acta Cybern.
- 2010
- 3
- PDF
References
SHOWING 1-10 OF 144 REFERENCES
Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1999
- 82
The ordinary differential equation defined by a computable function whose maximal interval of existence is non-computable
- Mathematics
- 2006
- 4
- PDF
A computable ordinary differential equation which possesses no computable solution
- Mathematics
- 1979
- 152
Computability in analysis and physics
- Mathematics, Computer Science
- Perspectives in Mathematical Logic
- 1989
- 840
- Highly Influential
- PDF
An Effective Cauchy-Peano Existence Theorem for Unique Solutions
- Mathematics, Computer Science
- Int. J. Found. Comput. Sci.
- 1996
- 26