Return to search

Computational Complexity of Hopfield Networks

There are three main results in this dissertation. They are PLS-completeness of discrete Hopfield network convergence with eight different restrictions, (degree 3, bipartite and degree 3, 8-neighbor mesh, dual of the knight's graph, hypercube, butterfly, cube-connected cycles and shuffle-exchange), exponential convergence behavior of discrete Hopfield network, and simulation of Turing machines by discrete Hopfield Network.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc278272
Date08 1900
CreatorsTseng, Hung-Li
ContributorsParberry, Ian, Tate, Stephen B., Jacob, Roy Thomas
PublisherUniversity of North Texas
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
Formatvii, 98 leaves : ill., Text
RightsPublic, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Tseng, Hung-Li

Page generated in 0.002 seconds