Show simple item record

dc.contributor.authorŠíma, Jiří
dc.contributor.authorOrponen, Pekka
dc.contributor.authorAntti-Poika, Teemu
dc.date.accessioned2018-07-18T05:46:17Z
dc.date.available2018-07-18T05:46:17Z
dc.date.issued1999fi
dc.identifier.citationŠíma, J., Orponen, P., & Antti-Poika, T. (1999). Some afterthoughts on Hopfield networks. In J. Pavelka, G. Tel, & M. Bartošek (Eds.), <em>SOFSEM'99: Theory and Practice of Informatics</em> (pp. 459-469). Lecture Notes in Computer Science, 1725. Berlin Heidelberg New York: Springer-Verlag. <a href="https://doi.org/10.1007/3-540-47849-3_34">doi:10.1007/3-540-47849-3_34</a>fi
dc.identifier.otherTUTKAID_1410
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/58970
dc.description.abstractIn 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.fi
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherSpringer-Verlag
dc.relation.ispartofSOFSEM'99: Theory and Practice of Informatics
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.rightsIn Copyright
dc.subject.otherHopfield netsfi
dc.subject.othernetworksfi
dc.subject.otherHopfieldfi
dc.titleSome afterthoughts on Hopfield networksfi
dc.typeconferenceObject
dc.identifier.urnURN:NBN:fi:jyu-201807173591
dc.contributor.laitosMatematiikan ja tilastotieteen laitosfi
dc.contributor.laitosDepartment of Mathematics and Statisticsen
dc.type.urihttp://purl.org/eprint/type/ConferencePaper
dc.date.updated2018-07-17T09:15:17Z
dc.relation.isbn3-540-66694-X
dc.description.reviewstatuspeerReviewed
dc.format.pagerange459-469
dc.relation.issn0302-9743
dc.relation.numberinseries1725
dc.type.versionacceptedVersion
dc.rights.copyright© Springer-Verlag Berlin Heidelberg 1999
dc.rights.accesslevelopenAccessfi
dc.relation.conferenceInternational Conference on Current Trends in Theory and Practice of Computer Science
dc.format.contentfulltext
dc.rights.urlhttp://rightsstatements.org/page/InC/1.0/?language=en
dc.relation.doi10.1007/3-540-47849-3_34


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

In Copyright
Except where otherwise noted, this item's license is described as In Copyright