Back to search

University of North Texas

Computational Complexity of Hopfield Networks

Abstract

dc:description

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.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1998

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tseng, Hung-Li
Contributors dc:contributor
  • Parberry, Ian
  • Tate, Stephen B.
  • Jacob, Roy Thomas

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Tseng, Hung-Li
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81d no.4719
local-cont-no: 1002658996-tseng
untcat: b2120534
https://digital.library.unt.edu/ark:/67531/metadc278272/
ark: ark:/67531/metadc278272

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Tseng, Hung-Li. Computational Complexity of Hopfield Networks. University of North Texas, 1998. https://doi.org/10.12794/metadc278272