The Computational Power of Discrete Hopfield Nets with Hidden Units

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

by Pekka Orponen

Venue:	Neural Computation
Citations:	10 - 6 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Computational Power of Discrete Hopfield Nets with Hidden Units	user correction - Legacy Corrections
AUTHOR NAME	Pekka Orponen	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Helsinki	SVM HeaderParse 0.2
AUTHOR ADDR	Finland	SVM HeaderParse 0.2
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.	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	Neural Computation	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	403--415	INFERENCE
VOLUME	8	INFERENCE
CITATIONS	34 found	ParsCit 1.0