The complexity of computing in continuous time: space complexity is precision
From MaRDI portal
Cites work
- A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: simulation of Turing machines with analytic discrete ODEs
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- A computable ordinary differential equation which possesses no computable solution
- A continuous characterization of PSPACE using polynomial ordinary differential equations
- A Survey on Analog Models of Computation
- A tutorial on computable analysis
- A Universal Ordinary Differential Equation
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- Analog computers and recursive functions over the reals.
- Computability of Differential Equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computational complexity of smooth differential equations
- Computational complexity of solving polynomial differential equations over unbounded domains
- Computing with polynomial ordinary differential equations
- Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1956513 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 953683 (Why is no real title available?)
- scientific article; zbMATH DE number 1390027 (Why is no real title available?)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
- Iteration, inequalities, and differentiability in analog computers
- Mathematical Theory of the Differential Analyzer
- New Computational Paradigms
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On computable numbers, with an application to the Entscheidungsproblem.
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of solving initial value problems
- On the computational complexity of ordinary differential equations
- On the concept of attractor
- On the functions generated by the general purpose analog computer
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- 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
- Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- Recursive function theory and numerical analysis
- Strong Turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs
- The concept of effective method applied to computational problems of linear algebra
- Universal computation and other capabilities of hybrid and continuous dynamical systems
Cited in
(3)
This page was built for publication: The complexity of computing in continuous time: space complexity is precision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875053)
