Work

The Computational Power of Discrete Hopfield Nets with Hidden Units

Year: 1996
Type: article
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.
Language: English
Open Access status: green
OpenAlex ID: W2120797099
FWCI: 4.279
Cites: 31
Cited by: 27
Related to: 10