6533b861fe1ef96bd12c43bd

RESEARCH PRODUCT

Some Afterthoughts on Hopfield Networks

Teemu Antti-poikaPekka OrponenJirí Síma

subject

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESQuantitative Biology::Neurons and CognitionComputer scienceParallel algorithmHopfield netsApproximation algorithmSection (fiber bundle)Hopfield networknetworksHopfieldAlgorithmTime complexityEquivalence (measure theory)Energy (signal processing)

description

In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to network size. In Section 3, the convergence time of Hopfield nets is analyzed in terms of bit representations. In Section 4, a polynomial time approximate algorithm for the minimum energy problem is shown. In Section 5, the Turing universality of analog Hopfield nets is studied. peerReviewed

yearjournalcountryeditionlanguage
1999-01-01
https://doi.org/10.1007/3-540-47849-3_34