## General Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (2003)

by
Jiri Sima
,
Pekka Orponen

Citations: | 2 - 0 self |

### BibTeX

@MISC{Sima03generalpurpose,

author = {Jiri Sima and Pekka Orponen},

title = {General Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results},

year = {2003}

}

### OpenURL

### Abstract

We survey and summarize the existing literature on the computational aspects of neural network models, by presenting a detailed taxonomy of the various models according to their complexity theoretic characteristics. The criteria of classi cation include e.g. the architecture of the network (feedforward vs. recurrent), time model (discrete vs. continuous), state type (binary vs. analog), weight constraints (symmetric vs. asymmetric), network size ( nite nets vs. in - nite families), computation type (deterministic vs. probabilistic), etc.