## The Computational Power of Discrete Hopfield Nets with Hidden Units (1996)

by
Pekka Orponen

Venue: | Neural Computation |

Citations: | 11 - 6 self |

### BibTeX

@ARTICLE{Orponen96thecomputational,

author = {Pekka Orponen},

title = {The Computational Power of Discrete Hopfield Nets with Hidden Units},

journal = {Neural Computation},

year = {1996},

volume = {8},

pages = {403--415}

}

### OpenURL

### Abstract

We prove that polynomial size discrete Hopfield networks with hidden units compute exactly the class of Boolean functions PSPACE/poly, i.e., the same functions as are computed by polynomial space-bounded nonuniform Turing machines. As a corollary to the construction, we observe also that networks with polynomially bounded interconnection weights compute exactly the class of functions P/poly, i.e., the class computed by polynomial time-bounded nonuniform Turing machines.