Polynomial differential equations compute all real computable functions on computable compact intervals
DOI10.1016/J.JCO.2006.12.005zbMATH Open1125.68059OpenAlexW2108904240WikidataQ56018224 ScholiaQ56018224MaRDI QIDQ2371306FDOQ2371306
Authors: Emmanuel Hainry, Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Graça 
Publication date: 4 July 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.1/1011
Recommendations
- Computability with polynomial differential equations
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- Computational bounds on polynomial differential equations
- Differentiability of polynomial time computable functions
- Functions computable in polynomial space
- Computation of all polynomial solutions of a class of nonlinear differential equations
- Computational complexity of solving polynomial differential equations over unbounded domains
- Computability on reals, infinite limits and differential equations
- scientific article; zbMATH DE number 3932433
- Relatively computable functions of real variables
differential equationscomputable analysisanalog computationgeneral-purpose analog computerChurch-Turing thesis
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78) General theory for ordinary differential equations (34A99)
Cites Work
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Computability with polynomial differential equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- 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
- 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)
- Mathematical Theory of the Differential Analyzer
- Title not available (Why is that?)
- On the definitions of computable real continuous functions
- Title not available (Why is that?)
- New Computational Paradigms
- A Differentially Algebraic Replacement Theorem, and Analog Computability
- Real recursive functions and their hierarchy
- Recursive analysis characterized as a class of real recursive functions
- A Survey of Transcendentally Transcendental Functions
Cited In (25)
- Programming with ordinary differential equations: some first steps towards a programming language
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- Characterizing Computable Analysis with Differential Equations
- Characterizing time computational complexity classes with polynomial differential equations
- A Survey on Analog Models of Computation
- Turing machines can be efficiently simulated by the general purpose analog computer
- Computability of analog networks
- A characterization of computable analysis on unbounded domains using differential equations
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
- Abstract geometrical computation. V: Embedding computable analysis
- A survey of recursive analysis and Moore's notion of real computation
- The elementary computable functions over the real numbers: applying two new techniques
- Theoretical computer science: computability, decidability and logic
- Computing with polynomial ordinary differential equations
- Constructibility of the universal wave function
- On the functions generated by the general purpose analog computer
- Uniqueness in planar endogenous business cycle theories
- Constructing general partial differential equations using polynomial and neural networks
- Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
- Theory and Applications of Models of Computation
- Computability and dynamical systems
- Distributed Learning of Wardrop Equilibria
- Computing with chemical reaction networks: a tutorial
- A continuous characterization of PSPACE using polynomial ordinary differential equations
This page was built for publication: Polynomial differential equations compute all real computable functions on computable compact intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371306)
