Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
From MaRDI portal
Recommendations
- Efficient continuous-time asymmetric Hopfield networks for memory retrieval
- High-symmetry Hopfield-type neural networks
- scientific article; zbMATH DE number 1849152
- Networks of spiking neurons can emulate arbitrary Hopfield nets in temporal coding
- Continuous attractors in Hopfield neural networks
- Hopfield networks and symmetry groups
- A broad class of discrete-time hypercomplex-valued Hopfield neural networks
Cites work
- A theory of complexity for continuous time systems
- Absolute stability of global pattern formation and parallel memory storage by competitive neural networks
- Analog computation via neural networks
- Computability with low-dimensional dynamical systems
- Computational power of neural networks: a characterization in terms of Kolmogorov complexity
- Neural networks and physical systems with emergent collective computational abilities
- Neurons with graded response have collective computational properties like those of two-state neurons
- On the computational power of neural nets
- Theory of neuromata
- Unpredictability and undecidability in dynamical systems
Cited in
(6)- On the computational efficiency of symmetric neural networks
- Computing with truly asynchronous threshold logic networks
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
- scientific article; zbMATH DE number 1490012 (Why is no real title available?)
- On the computational power of discrete Hopfield nets
- scientific article; zbMATH DE number 1849152 (Why is no real title available?)
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 Q4816928)
