Computability and dynamical systems
From MaRDI portal
Recommendations
Cites work
- A computer-assisted proof of the Feigenbaum conjectures
- A rigorous ODE solver and Smale's 14th problem
- Achilles and the tortoise climbing up the arithmetical hierarchy
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- An equation for continuous chaos
- Chaotic dynamics in hybrid systems
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computability and the morphological complexity of some dynamics on continuous domains
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computability of topological pressure for shifts of finite type with applications in statistical physics
- Computability theoretic properties of the entropy of gap shifts
- Computability with polynomial differential equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computational bounds on polynomial differential equations
- Computational unsolvability of domains of attraction of nonlinear systems
- Computing Domains of Attraction for Planar Dynamics
- Computing over the reals: foundations for scientific computing.
- Computing the topological entropy of shifts
- Continuity and computability of reachable sets
- Controllers for reachability specifications for hybrid systems
- Deterministic Nonperiodic Flow
- Differentiable dynamical systems
- Dynamical systems: stability and simulability
- Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 5117086 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (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?)
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Mathematical control theory: an introduction
- Mathematical problems for the next century
- Non-computable Julia sets
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Shifts with decidable language and non-computable entropy
- Structural stability on two-dimensional manifolds
- Structurally Stable Systems are not Dense
- The computational complexity of some Julia sets
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- The stability of saturated linear dynamical systems is undecidable
- The topological entropy of iterated piecewise affine maps is uncomputable
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Topological complexity of blowup problems
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Unpredictability and undecidability in dynamical systems
Cited in
(21)- Computing the uncomputable; or, the discrete charm of second-order simulacra
- Computational ergodic theory
- Computability, noncomputability, and hyperbolic systems
- Computing with dynamical systems
- Computer assisted proofs in dynamical systems
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Some results in finite and discrete dynamical systems
- Dynamical systems: stability and simulability
- On Turing dynamical systems and the Atiyah problem
- scientific article; zbMATH DE number 7075877 (Why is no real title available?)
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Computable analysis with applications to dynamic systems
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Effective Computation for Nonlinear Systems
- Machines, Computations, and Universality
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Probability, statistics and computation in dynamical systems
- Dynamics and abstract computability: computing invariant measures
- Computability in Dynamical Systems
- Computer assisted studies in dynamical systems
- Computability and the morphological complexity of some dynamics on continuous domains
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)
