Programming with ordinary differential equations: some first steps towards a programming language
From MaRDI portal
Publication:2104250
DOI10.1007/978-3-031-08740-0_4OpenAlexW4285111708MaRDI QIDQ2104250
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_4
Cites Work
- Unnamed Item
- Unnamed Item
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Universal formulae and universal differential equations
- Analog computers and recursive functions over the reals.
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Computability with polynomial differential equations
- A computable ordinary differential equation which possesses no computable solution
- A universal differential equation
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- A Survey on Analog Models of Computation
- A Universal Ordinary Differential Equation
- Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
- Mathematical Theory of the Differential Analyzer
- Characterizing time computational complexity classes with polynomial differential equations
- A continuous characterization of PSPACE using polynomial ordinary differential equations
