Computability, Complexity and Programming with Ordinary Differential Equations

DOI10.4230/LIPICS.STACS.2020.3MaRDI QIDQ5874273zbMATH OpenOpenAlexFDO

Authors Olivier Bournez

Publication date 7 February 2023

Full work available at URL https://hal-polytechnique.archives-ouvertes.fr/hal-03668004

zbMATH Keywords

analog computationsdiscrete ordinary differential equationsimplicit complexitymodels of computationordinary differential equationsrecursion scheme

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• Programming with ordinary differential equations: some first steps towards a programming language
• On the computational complexity of ordinary differential equations
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks

This page was built for publication: Computability, Complexity and Programming with Ordinary Differential Equations

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