We prove that polynomial size discrete synchronous 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.
CITATION STYLE
Orponen, P. (1993). On the computational power of discrete hopfield nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 215–226). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_74
Mendeley helps you to discover research relevant for your work.