A Step towards a Complexity Theory for Analog Systems

DOI10.1002/1521-3870(200210)48:1+%3C45::AID-MALQ45%3E3.0.CO;2-7MaRDI QIDQ4787856zbMATH OpenOpenAlexFDO

Authors Marco Gori, Klaus Meer

Publication date 8 January 2003

Full work available at URL https://doi.org/10.1002/1521-3870(200210)48:1+%3C45::aid-malq45%3E3.0.co;2-7

zbMATH Keywords

analog computationenergy functions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of dynamical systems (37N99)

Recommendations

• Some Aspects of a Complexity Theory for Continuous Time Systems
• Analog computation with dynamical systems
• A theory of complexity for continuous time systems
• A survey on continuous time computations
• Machines, Computations, and Universality

Cited in

(10)

• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Towards an Axiomatization of Simple Analog Algorithms
• A survey on continuous time computations
• Analog computation with dynamical systems
• Computability of analog networks
• The complexity of analog computation
• Some Aspects of a Complexity Theory for Continuous Time Systems
• Exponential transients in continuous-time Liapunov systems.
• A theory of complexity for continuous time systems
• A Survey on Analog Models of Computation

This page was built for publication: A Step towards a Complexity Theory for Analog Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787856)