Computing with Continuous-Time Liapunov Systems.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06010034" target="_blank" >RIV/67985807:_____/01:06010034 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computing with Continuous-Time Liapunov Systems.
Original language description
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. More precisely, we prove that any function computed by a discrete-time asymmetric recurrent network of n threshold gates can also be computed by a continuous-time symmetrically-coupled Hopfield system of dimension 18n+7. Moreover, if the threshold logic network has maximum weight...
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing.
ISBN
1-58113-349-9
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
722-731
Publisher name
ACM
Place of publication
New York
Event location
Crete [GR]
Event date
Jul 6, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—