Computability and computational complexity of the evolution of nonlinear dynamical systems

DOI10.1007/978-3-642-39053-1_2zbMATH Open1387.68131OpenAlexW72490594MaRDI QIDQ5326355FDOQ5326355

Authors: Amaury Pouly, Ning Zhong, Olivier Bournez, Daniel 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

Recommendations

• Computability and dynamical systems
• scientific article; zbMATH DE number 1530469
• Nonlinear phenomena in spaces of algorithms
• Nonlinear Computation
• Analog computation with dynamical systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78) Dynamics induced by flows and semiflows (37C10)

Cites Work

• Deterministic Nonperiodic Flow
• Title not available (Why is that?)
• Title not available (Why is that?)
• Differentiable dynamical systems
• Title not available (Why is that?)
• A new view of the computational complexity of IVP for ODE
• Computability with polynomial differential equations
• Church's thesis meets the \(N\)-body problem
• Title not available (Why is that?)
• Solving analytic differential equations in polynomial time over unbounded domains
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Lorenz attractor exists
• Title not available (Why is that?)
• AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
• On the complexity of solving initial value problems
• On Non-Linear Differential Equations of the Second Order: I. the Equation y¨ − k (1-y ² )y˙ + y = b λk cos(λl + α), k Large
• Mathematical problems for the next century
• Title not available (Why is that?)
• Title not available (Why is that?)
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Some recent developments on Shannon's General Purpose Analog Computer
• Classical recursion theory. Vol. II
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Achilles and the tortoise climbing up the arithmetical hierarchy
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Title not available (Why is that?)
• Computability in planar dynamical systems
• Computability, noncomputability, and hyperbolic systems
• Computational unsolvability of domains of attraction of nonlinear systems
• Computational Complexity of One-Step Methods for Systems of Differential Equations
• Topological complexity of blowup problems
• Making big steps in trajectories

Cited In (7)

• Title not available (Why is that?)
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Title not available (Why is that?)
• Study of dynamical systems from the viewpoint of complexity and computational capabilities
• Noise vs computational intractability in dynamics
• Computability and dynamical systems
• 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)