On the computational power of discrete Hopfield nets

DOI10.1007/3-540-56939-1_74MaRDI QIDQ4630262zbMATH OpenOpenAlexFDO

Authors Pekka Orponen

Publication date 29 March 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56939-1_74

zbMATH Keywords

Boolean functionTuring machinedelay lineHopfield networkclock pulse

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1490012
• scientific article; zbMATH DE number 4201618
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
• Some results on the computational complexity of symmetric connectionist networks.

Cites work

• scientific article; zbMATH DE number 4201673 (Why is no real title available?)
• scientific article; zbMATH DE number 4155875 (Why is no real title available?)
• scientific article; zbMATH DE number 4168493 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 19763 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• scientific article; zbMATH DE number 49141 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A logical calculus of the ideas immanent in nervous activity
• Analog computation via neural networks
• Decreasing energy functions as a tool for studying threshold networks
• Neural networks and complexity theory
• 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 characterizations of the class PSPACE/poly
• On periodical behaviour in societies with symmetric influences
• Self-organization and associative memory
• The convergence of symmetric threshold automata
• Transient length in sequential iteration of threshold functions
• Turing machines that take advice
• ``Neural computation of decisions in optimization problems

Cited in

(3)

• An application of Hopfield networks to worst-case power analysis of RT-level VLSI systems
• Efficient Associative Computation with Discrete Synapses
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

This page was built for publication: On the computational power of discrete Hopfield nets

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