dc.contributor.author | Šíma, Jiří | |
dc.contributor.author | Orponen, Pekka | |
dc.contributor.author | Antti-Poika, Teemu | |
dc.contributor.editor | Pavelka, J. | |
dc.contributor.editor | Tel, G. | |
dc.contributor.editor | Bartošek, M. | |
dc.date.accessioned | 2018-07-18T05:46:17Z | |
dc.date.available | 2018-07-18T05:46:17Z | |
dc.date.issued | 1999 | |
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.), <i>SOFSEM'99: Theory and Practice of Informatics</i> (pp. 459-469). Springer-Verlag. Lecture Notes in Computer Science, 1725. <a href="https://doi.org/10.1007/3-540-47849-3_34" target="_blank">https://doi.org/10.1007/3-540-47849-3_34</a> | |
dc.identifier.other | CONVID_14790470 | |
dc.identifier.other | TUTKAID_1410 | |
dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/58970 | |
dc.description.abstract | 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. | fi |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.publisher | Springer-Verlag | |
dc.relation.ispartof | SOFSEM'99: Theory and Practice of Informatics | |
dc.relation.ispartofseries | Lecture Notes in Computer Science | |
dc.rights | In Copyright | |
dc.subject.other | Hopfield nets | |
dc.subject.other | networks | |
dc.subject.other | Hopfield | |
dc.title | Some afterthoughts on Hopfield networks | |
dc.type | conferenceObject | |
dc.identifier.urn | URN:NBN:fi:jyu-201807173591 | |
dc.contributor.laitos | Matematiikan ja tilastotieteen laitos | fi |
dc.contributor.laitos | Department of Mathematics and Statistics | en |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | |
dc.date.updated | 2018-07-17T09:15:17Z | |
dc.relation.isbn | 3-540-66694-X | |
dc.description.reviewstatus | peerReviewed | |
dc.format.pagerange | 459-469 | |
dc.relation.issn | 0302-9743 | |
dc.relation.numberinseries | 1725 | |
dc.type.version | acceptedVersion | |
dc.rights.copyright | © Springer-Verlag Berlin Heidelberg 1999 | |
dc.rights.accesslevel | openAccess | fi |
dc.relation.conference | International Conference on Current Trends in Theory and Practice of Computer Science | |
dc.format.content | fulltext | |
dc.rights.url | http://rightsstatements.org/page/InC/1.0/?language=en | |
dc.relation.doi | 10.1007/3-540-47849-3_34 | |