Computation with perturbed dynamical systems
From MaRDI portal
Publication:355515
DOI10.1016/j.jcss.2013.01.025zbMath1410.68119OpenAlexW2084512612MaRDI QIDQ355515
Emmanuel Hainry, Olivier Bournez, Daniel Silva Graça
Publication date: 24 July 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.025
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of dynamical systems (37N99) Computation over the reals, computable analysis (03D78)
Related Items (2)
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Computability and Beltrami fields in Euclidean space
Cites Work
- 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
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- What's decidable about hybrid automata?
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Classical recursion theory. Vol. II
- Analog computation via neural networks
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Hybrid systems: computation and control. 7th international workshop, HSCC 2004, Philadelphia, PA, USA, March 25--27, 2004. Proceedings.
- On the computational power of neural nets
- Computability with polynomial differential equations
- Continuity and computability of reachable sets
- Semantics and Computability of the Evolution of Hybrid Systems
- On the definitions of computable real continuous functions
- Robust Computations with Dynamical Systems
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Unpredictability and undecidability in dynamical systems
- Automata, Languages and Programming
- New Computational Paradigms
- Achilles and the tortoise climbing up the arithmetical hierarchy
This page was built for publication: Computation with perturbed dynamical systems
