Computability and dynamical systems
From MaRDI portal
Publication:2908425
DOI10.1007/978-3-642-11456-4_11zbMATH Open1253.37020OpenAlexW926519MaRDI QIDQ2908425FDOQ2908425
Authors: Jorge Buescu, Ning Zhong, Daniel 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
Recommendations
Dynamics induced by flows and semiflows (37C10) Applications of computability and recursion theory (03D80) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- A rigorous ODE solver and Smale's 14th problem
- Deterministic Nonperiodic Flow
- Quantum theory, the Church–Turing principle and the universal quantum computer
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Title not available (Why is that?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Differentiable dynamical systems
- Mathematical control theory: an introduction
- Computational bounds on polynomial differential equations
- An equation for continuous chaos
- Computability with polynomial differential equations
- 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?)
- Title not available (Why is that?)
- Mathematical problems for the next century
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Title not available (Why is that?)
- The topological entropy of iterated piecewise affine maps is uncomputable
- Controllers for reachability specifications for hybrid systems
- Structurally Stable Systems are not Dense
- Structural stability on two-dimensional manifolds
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Shifts with decidable language and non-computable entropy
- A computer-assisted proof of the Feigenbaum conjectures
- The computational complexity of some Julia sets
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Continuity and computability of reachable sets
- Unpredictability and undecidability in dynamical systems
- Achilles and the tortoise climbing up the arithmetical hierarchy
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Computing the topological entropy of shifts
- Computing over the reals: foundations for scientific computing.
- Non-computable Julia sets
- Computational unsolvability of domains of attraction of nonlinear systems
- The stability of saturated linear dynamical systems is undecidable
- Computability theoretic properties of the entropy of gap shifts
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Title not available (Why is that?)
- Chaotic dynamics in hybrid systems
- Dynamical systems: stability and simulability
- Computability and the morphological complexity of some dynamics on continuous domains
- Computing Domains of Attraction for Planar Dynamics
- Topological complexity of blowup problems
- 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
Cited In (20)
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Title not available (Why is that?)
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Computing with dynamical systems
- Probability, statistics and computation in dynamical systems
- Computational ergodic theory
- Dynamical systems: stability and simulability
- Computer assisted proofs in dynamical systems
- Effective Computation for Nonlinear Systems
- On Turing dynamical systems and the Atiyah problem
- Computability in Dynamical Systems
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Dynamics and abstract computability: computing invariant measures
- Computing the uncomputable; or, the discrete charm of second-order simulacra
- Computer assisted studies in dynamical systems
- Computable analysis with applications to dynamic systems
- Computability and the morphological complexity of some dynamics on continuous domains
- Machines, Computations, and Universality
- Computability, noncomputability, and hyperbolic systems
This page was built for publication: Computability and dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908425)
