Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Maass, W.
Right arrow Articles by Orponen, P.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Maass, W.
Right arrow Articles by Orponen, P.

Neural Computation, Vol 10, 1071-1095, Copyright © 1998 by The MIT Press


LETTERS

On the Effect of Analog Noise in Discrete-Time Analog Computations

Wolfgang Maass and Pekka Orponen

We introduce a model for analog computation with discrete time in the presence of analog noise that is flexible enough to cover the most important concrete cases, such as noisy analog neural nets and networks of spiking neurons. This model subsumes the classical model for digital computation in the presence of noise. We show that the presence of arbitrarily small amounts of analog noise reduces the power of analog computational models to that of finite automata, and we also prove a new type of upper bound for the VC-dimension of computational models with analog noise.


This article has been cited by other articles:


Home page
Proc. Natl. Acad. Sci. USAHome page
R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro
Stochastic computing with biomolecular automata
PNAS, July 6, 2004; 101(27): 9960 - 9965.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
J. Sima and P. Orponen
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
Neural Comput., December 1, 2003; 15(12): 2727 - 2778.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
B. Hammer and P. Tino
Recurrent Neural Networks with Small Weights Implement Definite Memory Machines
Neural Comput., August 1, 2003; 15(8): 1897 - 1929.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
J. Sima and P. Orponen
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
Neural Comput., March 1, 2003; 15(3): 693 - 733.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. C. Kremer
Spatiotemporal Connectionist Networks: A Taxonomy and Review
Neural Comput., February 1, 2001; 13(2): 249 - 306.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
J. Síma, P. Orponen, and T. Antti-Poika
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
Neural Comput., December 1, 2000; 12(12): 2965 - 2989.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
R. C. Carrasco, M. L. Forcada, M. A. Valdés-Muñoz, and R. P. Ñeco
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units
Neural Comput., September 1, 2000; 12(9): 2129 - 2174.
[Abstract] [Full Text]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1998 by The MIT Press.