## Some Afterthoughts on Hopfield Networks (1999)

### BibTeX

@TECHREPORT{Sima99someafterthoughts,

author = {Jiri Sima and Pekka Orponen and Teemu Antti-Poika},

title = {Some Afterthoughts on Hopfield Networks},

institution = {},

year = {1999}

}

### OpenURL

### Abstract

The present paper investigates four relatively independent issues, each in one section, which complete our knowledge regarding the computational aspects of popular Hopfield nets [9]. In Section 2, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to the 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.