Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
From MaRDI portal
Publication:5326355
DOI10.1007/978-3-642-39053-1_2zbMath1387.68131OpenAlexW72490594MaRDI QIDQ5326355
Ning Zhong, Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_2
Analysis of algorithms and problem complexity (68Q25) Dynamics induced by flows and semiflows (37C10) Computation over the reals, computable analysis (03D78)
Related Items (2)
On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Lattice structures for attractors. II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Classical recursion theory. Vol. II
- Mathematical problems for the next century
- Computability in planar dynamical systems
- A new view of the computational complexity of IVP for ODE
- Computability, noncomputability, and hyperbolic systems
- Computability with polynomial differential equations
- Church's thesis meets the \(N\)-body problem
- Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
- Some recent developments on Shannon's General Purpose Analog Computer
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computational Complexity of One-Step Methods for Systems of Differential Equations
- The Lorenz attractor exists
- Deterministic Nonperiodic Flow
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- On the complexity of solving initial value problems
- Computational unsolvability of domains of attraction of nonlinear systems
- Differentiable dynamical systems
- On Non-Linear Differential Equations of the Second Order: I. the Equation y¨ − k (1-y 2 )y˙ + y = b λk cos(λl + α), k Large
- Achilles and the tortoise climbing up the arithmetical hierarchy
This page was built for publication: Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems