On the computational power of discrete Hopfield nets

DOI10.1007/3-540-56939-1_74zbMath1422.68072OpenAlexW1487842606MaRDI QIDQ4630262

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

Hopfield networkTuring machineBoolean functiondelay lineclock pulse

Mathematics Subject Classification ID

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

Cites Work

• Self-organization and associative memory
• Turing machines that take advice
• ``Neural computation of decisions in optimization problems
• Decreasing energy functions as a tool for studying threshold networks
• On characterizations of the class PSPACE/poly
• Analog computation via neural networks
• Transient length in sequential iteration of threshold functions
• On periodical behaviour in societies with symmetric influences
• The convergence of symmetric threshold automata
• 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.
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item