## Complexity Issues in Discrete Hopfield Networks (1994)

Citations: | 18 - 4 self |

### BibTeX

@TECHREPORT{Floreen94complexityissues,

author = {Patrik Floreen and Pekka Orponen},

title = {Complexity Issues in Discrete Hopfield Networks},

institution = {},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hopfield networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most significantly: 1. the known upper and lower bounds for the convergence times of Hopfield nets (here we consider mainly worst-case results); 2. the power of Hopfield 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 Hopfield nets as associative memories. Draft chapter for the forthcoming book The Computational and Learning Complexity of Neural Networks: Advanced Topics (ed. Ian Parberry).