Number of the records: 1
Continuous-Time Symmetric Hopfield Nets are Computationally Universal
- 1.
SYSNO ASEP 0404612 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Continuous-Time Symmetric Hopfield Nets are Computationally Universal Author(s) Šíma, Jiří (UIVT-O) RID, SAI, ORCID
Orponen, P. (FI)Source Title Neural Computation - ISSN 0899-7667
Roč. 15, č. 3 (2003), s. 693-733Number of pages 41 s. Language eng - English Country US - United States Keywords continuous-time Hopfield network ; Liapunov function ; analog computation ; computational power ; Turing universality Subject RIV BA - General Mathematics R&D Projects IAB2030007 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) GA201/02/1456 GA ČR - Czech Science Foundation (CSF) CEZ 1030915 UT WOS 000180774000009 EID SCOPUS 0042878679 DOI 10.1162/089976603321192130 Annotation We establish a fundamental result in the theory of computation by continuous-time dynamical systems, by showing that systems corresponding to so called continuous-time symmetric Hopfield nets are capable of general computation. As is well known, such networks have very constrained, Liapunov-function controlled dynamics. Nevertheless, we show that they are universal and efficient computational devices, in the sense that any convergent fully parallel computation by a recurrent network of n discrete-time... Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2004
Number of the records: 1