Stability and looping in connectionist models with asymmetric weights
From MaRDI portal
Publication:1115639
DOI10.1007/BF00204771zbMath0664.68092MaRDI QIDQ1115639
Publication date: 1989
Published in: Biological Cybernetics (Search for Journal in Brave)
neural networks; operational semantics; decidability; NP-hard; Hopfield model; PSPACE; circle-network; connectionist models of computation; stabilization of asymmetric network
68T05: Learning and adaptive systems in artificial intelligence
Related Items
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Neural networks and complexity theory, Existence and non existence of limit cycles in Boolean networks