Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

DOI10.1162/089976603321192130zbMATH Open1088.68148DBLPjournals/neco/SimaO03OpenAlexW2137753056WikidataQ51639700 ScholiaQ51639700MaRDI QIDQ3375307FDOQ3375307

Authors: Jiří Šíma, Pekka Orponen 

Publication date: 7 March 2006

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/089976603321192130

Recommendations

• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
• Computing with continuous-time Liapunov systems
• scientific article; zbMATH DE number 1849152
• scientific article; zbMATH DE number 1490012
• On the computational power of discrete Hopfield nets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Neural networks and physical systems with emergent collective computational abilities
• Neurons with graded response have collective computational properties like those of two-state neurons
• Absolute stability of global pattern formation and parallel memory storage by competitive neural networks
• On the computational power of neural nets
• Computability with low-dimensional dynamical systems
• Analog computation via neural networks
• Unpredictability and undecidability in dynamical systems
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• A theory of complexity for continuous time systems
• Theory of neuromata

Cited In (5)

• Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology
• A Survey on Analog Models of Computation
• On the computational efficiency of symmetric neural networks
• On the computational power of discrete Hopfield nets
• Title not available (Why is that?)

This page was built for publication: Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

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