Some afterthoughts on Hopfield networks
Šíma, J., Orponen, P., & Antti-Poika, T. (1999). Some afterthoughts on Hopfield networks. In J. Pavelka, G. Tel, & M. Bartošek (Eds.), SOFSEM'99: Theory and Practice of Informatics (pp. 459-469). Lecture Notes in Computer Science, 1725. Berlin Heidelberg New York: Springer-Verlag. doi:10.1007/3-540-47849-3_34
Published inLecture Notes in Computer Science
© Springer-Verlag Berlin Heidelberg 1999
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.