Computing with continuous-time Liapunov systems

DOI10.1145/380752.380878MaRDI QIDQ5176031zbMATH OpenOpenAlexFDO

Authors Jiří Šíma, Pekka Orponen

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/380752.380878

zbMATH Keywords

Hopfield netsLyapunov systems

Mathematics Subject Classification ID

Smooth dynamical systems: general theory (37C99)

Recommendations

• Computation with perturbed dynamical systems
• Machines, Computations, and Universality
• Computing complete Lyapunov functions for discrete-time dynamical systems
• Computing continuous and piecewise affine Lyapunov functions for nonlinear systems
• Computation of non-monotonic Lyapunov functions for continuous-time systems
• Computation of continuous and piecewise affine Lyapunov functions for discrete-time systems
• Computational methods for Lyapunov functions
• Computing with dynamical systems
• Computational Approach for Complete Lyapunov Functions
• Computable analysis with applications to dynamic systems

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(7)

• Computing with truly asynchronous threshold logic networks
• Exponential transients in continuous-time Liapunov systems.
• Analog computation with dynamical systems
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
• Computation with perturbed dynamical systems
• scientific article; zbMATH DE number 1849152 (Why is no real title available?)
• Universal computation and other capabilities of hybrid and continuous dynamical systems

This page was built for publication: Computing with continuous-time Liapunov systems

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