Computability and Dynamical Systems

DOI10.1007/978-3-642-11456-4_11zbMath1253.37020OpenAlexW926519MaRDI QIDQ2908425

Jorge Buescu, Ning Zhong, Daniel Silva Graça

Publication date: 5 September 2012

Published in: Dynamics, Games and Science I (Search for Journal in Brave)

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

zbMATH Keywords

dynamical systemscomputability theorycomputable analysis

Mathematics Subject Classification ID

Related Items (2)

The Spacey Random Walk: A Stochastic Process for Higher-Order Data ⋮ Computability, noncomputability, and hyperbolic systems

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
• Structural stability on two-dimensional manifolds
• Computability and the morphological complexity of some dynamics on continuous domains
• Computational bounds on polynomial differential equations
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Controllers for reachability specifications for hybrid systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Mathematical problems for the next century
• A rigorous ODE solver and Smale's 14th problem
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Computability of probability measures and Martin-Löf randomness over metric spaces
• An equation for continuous chaos
• Computability with polynomial differential equations
• Continuity and computability of reachable sets
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Computing Domains of Attraction for Planar Dynamics
• Dynamical systems: stability and simulability
• The computational complexity of some julia sets
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• A computer-assisted proof of the Feigenbaum conjectures
• Quantum theory, the Church–Turing principle and the universal quantum computer
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• Unpredictability and undecidability in dynamical systems
• Deterministic Nonperiodic Flow
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics
• The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
• Computing the topological entropy of shifts
• Computational unsolvability of domains of attraction of nonlinear systems
• Non-computable Julia sets
• Structurally Stable Systems are not Dense
• Differentiable dynamical systems
• Achilles and the tortoise climbing up the arithmetical hierarchy
• Mathematical control theory: an introduction
• The stability of saturated linear dynamical systems is undecidable

This page was built for publication: Computability and Dynamical Systems