On the computational power of discrete Hopfield nets

DOI10.1007/3-540-56939-1_74zbMATH Open1422.68072OpenAlexW1487842606MaRDI QIDQ4630262FDOQ4630262

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

Recommendations

• scientific article; zbMATH DE number 1490012
• scientific article
• 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.

zbMATH Keywords

Boolean functionTuring machinedelay lineHopfield networkclock pulse

Mathematics Subject Classification ID

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

Cites Work

• Self-organization and associative memory
• Neural networks and physical systems with emergent collective computational abilities
• Title not available (Why is that?)
• On periodical behaviour in societies with symmetric influences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neurons with graded response have collective computational properties like those of two-state neurons
• A logical calculus of the ideas immanent in nervous activity
• ``Neural computation of decisions in optimization problems
• Title not available (Why is that?)
• Decreasing energy functions as a tool for studying threshold networks
• Title not available (Why is that?)
• Analog computation via neural networks
• Turing machines that take advice
• Transient length in sequential iteration of threshold functions
• The convergence of symmetric threshold automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• On characterizations of the class PSPACE/poly
• Neural networks and complexity theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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)