Computability with low-dimensional dynamical systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 14855 (Why is no real title available?)
- scientific article; zbMATH DE number 919600 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Every discrete input machine is linearly simulatable
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Iterates of piecewise monotone mappings on an interval
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the computational power of neural nets
- Tesselations with local transformations
- The existence of dendritic fronts
- Turing computability with neural nets
- Unpredictability and undecidability in dynamical systems
Cited in
(47)- A theory of complexity for continuous time systems
- Deciding the point-to-fixed-point problem for skew tent maps on an interval
- Universality of one-dimensional piecewise elementary maps
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
- Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability
- Computability and Beltrami fields in Euclidean space
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- An RNA-based theory of natural universal computation
- Welcoming the super Turing theories
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
- A Survey on Analog Models of Computation
- Undecidable event detection problems for ODEs of dimension one and two
- Iteration, inequalities, and differentiability in analog computers
- On the computational power of dynamical systems and hybrid systems
- About the domino problem for subshifts on groups
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- The stability of saturated linear dynamical systems is undecidable
- Diffusive influence systems
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
- Boundedness of the domain of definition is undecidable for polynomial ODEs
- A survey of computational complexity results in systems and control
- Topological formulation of termination properties of iterates of functions
- A decidable class of planar linear hybrid systems
- Dynamical recognizers: real-time language recognition by analog computers
- The simple dynamics of super Turing theories
- Chaos in computer performance
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- How much can analog and hybrid systems be proved (super-)Turing
- Computability with polynomial differential equations
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Reachability problems for one-dimensional piecewise affine maps
- Recursion theory on the reals and continuous-time computation
- What is a universal computing machine?
- Analog computers and recursive functions over the reals.
- On the decidability of reachability in continuous time linear time-invariant systems
- On the complexity of bounded time reachability for piecewise affine systems
- Complexity of reachability problems for finite discrete dynamical systems
- Deciding stability and mortality of piecewise affine dynamical systems
- Computation with perturbed dynamical systems
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Timed-automata abstraction of switched dynamical systems using control invariants
- Timed-automata abstraction of switched dynamical systems using control funnels
- On the Undecidability of the Tiling Problem
- Unconventional Computation
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
This page was built for publication: Computability with low-dimensional dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334658)
