Computability and computational complexity of the evolution of nonlinear dynamical systems
From MaRDI portal
Recommendations
Cites work
- A new view of the computational complexity of IVP for ODE
- Achilles and the tortoise climbing up the arithmetical hierarchy
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- Church's thesis meets the \(N\)-body problem
- Classical recursion theory. Vol. II
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Computability in planar dynamical systems
- Computability with polynomial differential equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computability, noncomputability, and hyperbolic systems
- Computational Complexity of One-Step Methods for Systems of Differential Equations
- Computational unsolvability of domains of attraction of nonlinear systems
- Deterministic Nonperiodic Flow
- Differentiable dynamical systems
- Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
- scientific article; zbMATH DE number 1581767 (Why is no real title available?)
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- scientific article; zbMATH DE number 3747561 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3484411 (Why is no real title available?)
- scientific article; zbMATH DE number 1182386 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 766966 (Why is no real title available?)
- scientific article; zbMATH DE number 2229941 (Why is no real title available?)
- scientific article; zbMATH DE number 3090395 (Why is no real title available?)
- Making big steps in trajectories
- Mathematical problems for the next century
- 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
- On the complexity of solving initial value problems
- Solving analytic differential equations in polynomial time over unbounded domains
- Some recent developments on Shannon's General Purpose Analog Computer
- The Lorenz attractor exists
- Topological complexity of blowup problems
- Universal computation and other capabilities of hybrid and continuous dynamical systems
Cited in
(9)- Noise vs computational intractability in dynamics
- Computability and dynamical systems
- Study of dynamical systems from the viewpoint of complexity and computational capabilities
- scientific article; zbMATH DE number 4041892 (Why is no real title available?)
- scientific article; zbMATH DE number 1341904 (Why is no real title available?)
- scientific article; zbMATH DE number 1530469 (Why is no real title available?)
- On the computational complexity of the Dirichlet problem for Poisson's equation
- scientific article; zbMATH DE number 912632 (Why is no real title available?)
- Lattice structures for attractors. II
This page was built for publication: Computability and computational complexity of the evolution of nonlinear dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326355)
