The computational power of continuous dynamic systems
From MaRDI portal
Recommendations
Cited in
(18)- A new conceptual framework for analog computation
- Computing the uncomputable; or, the discrete charm of second-order simulacra
- Approximation in a continuous model of computing
- Analytic machines
- On the computational power of dynamical systems and hybrid systems
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- Analog computation beyond the Turing limit
- Computability and dynamical systems
- Collective Computation With Continuous Variables
- Computation with perturbed dynamical systems
- Modelling of Complex Systems: Systems as Dataflow Machines
- scientific article; zbMATH DE number 1543334 (Why is no real title available?)
- scientific article; zbMATH DE number 4120061 (Why is no real title available?)
- A Step towards a Complexity Theory for Analog Systems
- Computing with continuous-time Liapunov systems
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Chomskian hierarchies of families of sets of piecewise continuous functions
- Computability and the morphological complexity of some dynamics on continuous domains
This page was built for publication: The computational power of continuous dynamic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710875)