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.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc278272 |
| Date | 08 1900 |
| Creators | Tseng, Hung-Li |
| Contributors | Parberry, Ian, Tate, Stephen B., Jacob, Roy Thomas |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | vii, 98 leaves : ill., Text |
| Rights | Public, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Tseng, Hung-Li |
Page generated in 0.0022 seconds