Transient length in sequential iteration of threshold functions
From MaRDI portal
Publication:1836811
DOI10.1016/0166-218X(83)90105-1zbMath0506.39004WikidataQ126657654 ScholiaQ126657654MaRDI QIDQ1836811
Eric Goles Chacc, Gérard Weisbuch, Francoise Fogelman
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Parallel and sequential computation on Boolean networks ⋮ On pre-periods of discrete influence systems ⋮ Sequential simulation of parallel iterations and applications ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Neural networks and complexity theory ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Fixing monotone Boolean networks asynchronously ⋮ Threshold behavior of bootstrap percolation ⋮ On the computational power of discrete Hopfield nets ⋮ A characterization of the existence of energies for neural networks ⋮ On the spread of influence in graphs ⋮ Computing with truly asynchronous threshold logic networks ⋮ Fixed points and 2-cycles of synchronous dynamic coloring processes on trees ⋮ Dynamics of positive automata networks ⋮ Decreasing energy functions as a tool for studying threshold networks
Cites Work