|
|
||||||||
Neural Computation, Vol 8, 805-818, Copyright © 1996 by The MIT Press
ARTICLES |
B DasGupta and G Schnitger
Department of Computer Science, University of Waterloo, Ontario, Canada.
We show that neural networks with three-times continuously differentiable activation functions are capable of computing a certain family of n-bit boolean functions with two gates, whereas networks composed of binary threshold functions require at least omega(log n) gates. Thus, for a large class of activation functions, analog neural networks can be more powerful than discrete neural networks, even when computing Boolean functions.
This article has been cited by other articles:
![]() |
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] |
||||
![]() |
J. Vohradsky Neural Model of the Genetic Network J. Biol. Chem., September 21, 2001; 276(39): 36168 - 36173. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |