Universal computation and other capabilities of hybrid and continuous dynamical systems
From MaRDI portal
Publication:673870
DOI10.1016/0304-3975(94)00147-BzbMath0874.68207MaRDI QIDQ673870
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
An analog characterization of the Grzegorczyk hierarchy ⋮ Characterizing time computational complexity classes with polynomial differential equations ⋮ Target problems under state constraints for nonlinear controlled impulsive systems ⋮ On the computational power of dynamical systems and hybrid systems ⋮ Computability and Dynamical Systems ⋮ Reachability analysis of dynamical systems having piecewise-constant derivatives ⋮ Computation with perturbed dynamical systems ⋮ A note on discreteness and virtuality in analog computing ⋮ Stability analysis for systems with impulse effects ⋮ Some bounds on the computational power of piecewise constant derivative systems (extended abstract) ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ An RNA-based theory of natural universal computation ⋮ Buridan's principle ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ Chaos in computer performance ⋮ Generalized solutions to hybrid dynamical systems ⋮ Quantifying conformance using the Skorokhod metric ⋮ Continuous-time computation with restricted integration capabilities ⋮ Variable time step dynamics with choice ⋮ CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES ⋮ Iteration, inequalities, and differentiability in analog computers ⋮ A survey of computational complexity results in systems and control ⋮ Computability with polynomial differential equations ⋮ Nonlinear impulse target problems under state constraint: a numerical analysis based on viability theory ⋮ Unbounded viscosity solutions of hybrid control systems ⋮ A new conceptual framework for analog computation ⋮ Achilles and the tortoise climbing up the hyper-arithmetical hierarchy ⋮ A foundation for real recursive function theory ⋮ Computational bounds on polynomial differential equations ⋮ Differential dynamic logic for hybrid systems ⋮ Analog computation with dynamical systems ⋮ Programming with ordinary differential equations: some first steps towards a programming language
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid systems
- Turing computability with neural nets
- Zero-dimensional dynamical systems, formal languages, and universality
- Continuity of ODE solutions
- A logical DES approach to the design of hybrid control systems
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Differential automata and their discrete simulators
- General theory of metastable operation
- Logarithmic Sobolev inequalities and the growth of 𝐿^{𝑝} norms
- Unpredictability and undecidability in dynamical systems
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Logical Reversibility of Computation
