Complexity Issues in Discrete Hop eldNetworks

Abstract

We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hoppeld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general computing devices (as opposed to their applications to associative memory and optimization); 3. the complexity of the synthesis (\learning") and analysis problems related to Hoppeld nets as associative memories.

Cite this paper

@inproceedings{Flor1994ComplexityII, title={Complexity Issues in Discrete Hop eldNetworks}, author={Patrik Flor and Pekka Orponen}, year={1994} }