Computability with low-dimensional dynamical systems

DOI10.1016/0304-3975(94)90229-1zbMath0821.68053OpenAlexW2050076818MaRDI QIDQ1334658

Michel Cosnard, Pascal Koiran, Max H. Garzon

Publication date: 25 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90229-1

zbMATH Keywords

recurrent neural networks

Mathematics Subject Classification ID

Dynamical aspects of finite-dimensional Hamiltonian and Lagrangian systems (37J99)

Related Items

Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability, On The Complexity of Bounded Time Reachability for Piecewise Affine Systems, Diffusive Influence Systems, Reachability Problems for One-Dimensional Piecewise Affine Maps, On the computational power of dynamical systems and hybrid systems, The simple dynamics of super Turing theories, Recursion theory on the reals and continuous-time computation, On the complexity of bounded time and precision reachability for piecewise affine systems, Complexity of reachability problems for finite discrete dynamical systems, On the decidability and complexity of problems for restricted hierarchical hybrid systems, Dynamical recognizers: real-time language recognition by analog computers, An RNA-based theory of natural universal computation, Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels, Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines, Mortality and Edge-to-Edge Reachability are Decidable on Surfaces, Low dimensional hybrid systems -- decidable, undecidable, don't know, Timed-automata abstraction of switched dynamical systems using control invariants, On the decidability of reachability in continuous time linear time-invariant systems, Deciding the point-to-fixed-point problem for skew tent maps on an interval, REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS, About the Domino Problem for Subshifts on Groups, Chaos in computer performance, Undecidable event detection problems for ODEs of dimension one and two, Analog computers and recursive functions over the reals., Iteration, inequalities, and differentiability in analog computers, A survey of computational complexity results in systems and control, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Computability with polynomial differential equations, A decidable class of planar linear hybrid systems, Deciding stability and mortality of piecewise affine dynamical systems, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, The stability of saturated linear dynamical systems is undecidable, How much can analog and hybrid systems be proved (super-)Turing, On the Undecidability of the Tiling Problem, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, Reachability problems in low-dimensional nondeterministic polynomial maps over integers, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, Topological formulation of termination properties of iterates of functions, What is a universal computing machine?, A theory of complexity for continuous time systems, Computability and Beltrami fields in Euclidean space, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, A Survey on Analog Models of Computation

Cites Work