Computability in planar dynamical systems

DOI10.1007/s11047-010-9230-0zbMath1251.37035OpenAlexW2083461964MaRDI QIDQ1761693

Ning Zhong, Daniel Silva Graça

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10400.1/1005

zbMATH Keywords

equilibrium pointslimit cyclescomputabilitybasins of attractionplanar dynamical systems

Mathematics Subject Classification ID

Attractors and repellers of smooth dynamical systems and their topological structure (37C70) Dynamics induced by flows and semiflows (37C10) Computation over the reals, computable analysis (03D78)

Related Items (2)

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ Uniqueness in Planar Endogenous Business Cycle Theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational bounds on polynomial differential equations
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• Classical recursion theory. The theory of functions and sets of natural numbers
• Continuity and computability of reachable sets
• Dynamical systems: stability and simulability
• Computability theory of generalized functions
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Unpredictability and undecidability in dynamical systems
• Deterministic Nonperiodic Flow
• Computational unsolvability of domains of attraction of nonlinear systems
• Non-computable Julia sets
• The stability of saturated linear dynamical systems is undecidable
• What's new on Lorenz strange attractors?

This page was built for publication: Computability in planar dynamical systems