Intrinsic universality in automata networks. II: Glueing and gadgets

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The complexity of the bootstraping percolation and other problems
Computational complexity of threshold automata networks under different updating schemes
Memoryless computation: new results, constructions, and extensions
Reaction-diffusion automata: Three states implies universality
Complexity of reachability problems for finite discrete dynamical systems
Sufficient conditions for reachability in automata networks with priorities
PSPACE-completeness of majority automata networks
Decreasing energy functions as a tool for studying threshold networks
Periodic behaviour of generalized threshold functions
Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness
On some special classes of sequential dynamical systems
Freezing sandpiles and Boolean threshold networks: equivalence and complexity
On the complexity of generalized Q2R automaton
Convergence in (Social) Influence Networks
Cellular graph automata. I. basic concepts, graph property measurement, closure properties
Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
On the Sequence of Consecutive Powers of a Matrix in a Boolean Algebra
A logical calculus of the ideas immanent in nervous activity
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
On the effects of firing memory in the dynamics of conjunctive networks
Intrinsic universality in automata networks. I: Families and simulations
On the influence of the interaction graph on a finite dynamical system