On the effect of analog noise in discrete-time analog computations

Authors:
Wolfgang Maass;Pekka Orponen
Affiliations:
-;-
Venue:
Neural Computation
Year:
1998

Citing 21
Cited 23

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
Invariance of complexity measures for networks with unreliable gates

Journal of the ACM (JACM)
Efficient simulation of finite automata by neural nets

Journal of the ACM (JACM)
Distinctive features, categorical perception, and probability learning: some applications of a neural model

Neurocomputing: foundations of research
Lower bounds for the complexity of reliable boolean circuits with noisy gates

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Decision theoretic generalizations of the PAC model for neural net and other learning applications

Information and Computation
Computability with low-dimensional dynamical systems

Theoretical Computer Science
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers

Machine Learning - Special issue on COLT '93
Bounds on the complexity of recurrent neural network implementations of finite state machines

Neural Networks
Representation of finite state automata in recurrent radial basis function networks

Machine Learning
Constructing deterministic finite-state automata in recurrent neural networks

Journal of the ACM (JACM)
Fast sigmoidal networks via spiking neurons

Neural Computation
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Vapnik-Chervonenkis dimension of neural networks

The handbook of brain theory and neural networks
On The Computational Power of Probabilistic and Faulty Neural Networks

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On some Relations between Dynamical Systems and Transition Systems

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Computation: finite and infinite machines

Computation: finite and infinite machines
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction

Neural Computation
Lower bounds for the computational power of networks of spiking neurons

Neural Computation
Complete and partial fault tolerance of feedforward neural nets

IEEE Transactions on Neural Networks

Computing with continuous-time Liapunov systems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Generalization Ability of Recurrent Networks

ICANN '01 Proceedings of the International Conference on Artificial Neural Networks
Some Afterthoughts on Hopfield Networks

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Robust Implementaion of Finite Automata by Recurrent RBF Networks

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Computation in Gene Networks

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Continuous-time symmetric Hopfield nets are computationally universal

Neural Computation
Recurrent neural networks with small weights implement definite memory machines

Neural Computation
General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation
Incremental training of first order recurrent neural networks to predict a context-sensitive language

Neural Networks
On probabilistic analog automata

Theoretical Computer Science
Cognition and the Power of Continuous Dynamical Systems

Minds and Machines
Spatiotemporal Connectionist Networks: A Taxonomy and Review

Neural Computation
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets

Neural Computation
Decidability and Universality in Symbolic Dynamical Systems

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units

Neural Computation
2007 Special Issue: Edge of chaos and prediction of computational performance for neural circuit models

Neural Networks
A Characterization of Simple Recurrent Neural Networks with Two Hidden Units as a Language Recognizer

Neural Information Processing
Turing universality in dynamical systems

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Noisy turing machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computational universality in symbolic dynamical systems

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Robust simulations of turing machines with analytic maps and flows

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Recurrent networks for structured data - A unifying approach and its properties

Cognitive Systems Research
Decidability and Universality in Symbolic Dynamical Systems

Fundamenta Informaticae - SPECIAL ISSUE MCU2004

Quantified Score

Hi-index	0.00

Visualization

Abstract