A Survey of Continuous-Time Computation Theory (1997)
| Venue: | Advances in Algorithms, Languages, and Complexity |
| Citations: | 26 - 6 self |
BibTeX
@INPROCEEDINGS{Orponen97asurvey,
author = {Pekka Orponen},
title = {A Survey of Continuous-Time Computation Theory},
booktitle = {Advances in Algorithms, Languages, and Complexity},
year = {1997},
pages = {209--224},
publisher = {Kluwer Academic Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Motivated partly by the resurgence of neural computation research, and partly by advances in device technology, there has been a recent increase of interest in analog, continuous-time computation. However, while special-case algorithms and devices are being developed, relatively little work exists on the general theory of continuous-time models of computation. In this paper, we survey the existing models and results in this area, and point to some of the open research questions. 1 Introduction After a long period of oblivion, interest in analog computation is again on the rise. The immediate cause for this new wave of activity is surely the success of the neural networks "revolution", which has provided hardware designers with several new numerically based, computationally interesting models that are structurally sufficiently simple to be implemented directly in silicon. (For designs and actual implementations of neural models in VLSI, see e.g. [30, 45]). However, the more fundamental...
