[图书][B] Computing in nonlinear media and automata collectives
A Adamatzky - 2001 - taylorfrancis.com
Computing in Nonlinear Media and Automata Collectives presents an account of new ways
to design massively parallel computing devices in advanced mathematical models, such as …
to design massively parallel computing devices in advanced mathematical models, such as …
Universal dynamical computation in multidimensional excitable lattices
A Adamatzky - International Journal of Theoretical Physics, 1998 - Springer
We study two-and three-dimensional latticesnodes of which take three states: rest, eccited,
andrefractory, and deterministically update their states indiscrete time depending on the …
andrefractory, and deterministically update their states indiscrete time depending on the …
Intrinsic universality in automata networks II: Glueing and gadgets
M Ríos-Wilson, G Theyssier - Theoretical Computer Science, 2024 - Elsevier
An automata network (AN) is a finite graph where each node holds a state from a finite
alphabet and is equipped with a local map defining the evolution of the state of the node …
alphabet and is equipped with a local map defining the evolution of the state of the node …
Intrinsic universality in automata networks I: Families and simulations
M Ríos-Wilson, G Theyssier - Theoretical Computer Science, 2024 - Elsevier
An automata network (AN) is a finite graph where each node holds a state from a finite
alphabet and is equipped with a local map defining the evolution of the state of the node …
alphabet and is equipped with a local map defining the evolution of the state of the node …
[图书][B] Notes on cellular automata
JP Allouche, M Courbage, GS Skordev - 2000 - webusers.imj-prg.fr
Cellular automata were introduced by J. von Neumann (see 29]) after a suggestion of S.
Ulam 147, p. 274]. They are a self-reproducing model, that was designed in order to answer …
Ulam 147, p. 274]. They are a self-reproducing model, that was designed in order to answer …
On automata networks dynamics: an approach based on computational complexity theory
MAF Ríos Wilson - 2021 - repositorio.uchile.cl
An automata network (AN) is a network of entities, each holding a state from a finite set and
related by a graph structure called an\emph {interaction graph}. Each node evolves …
related by a graph structure called an\emph {interaction graph}. Each node evolves …
Intrinsic Universality in Automata Networks II: Glueing and Gadgets
MR Wilson, G Theyssier - 2023 - hal.science
An automata network (AN) is a finite graph where each node holds a state from a finite
alphabet and is equipped with a local map defining the evolution of the state of the node …
alphabet and is equipped with a local map defining the evolution of the state of the node …
Intrinsic Simulations and Universality in Automata Networks
M Ríos-Wilson, G Theyssier - arXiv preprint arXiv:2209.09527, 2022 - arxiv.org
An automata network (AN) is a finite graph where each node holds a state from a finite
alphabet and is equipped with a local map defining the evolution of the state of the node …
alphabet and is equipped with a local map defining the evolution of the state of the node …
On symmetry versus asynchronism: at the edge of universality in automata networks
MR Wilson, G Theyssier - arXiv preprint arXiv:2105.08356, 2021 - arxiv.org
An automata network (AN) is a finite graph where each node holds a state from a finite
alphabet and is equipped with a local map defining the evolution of the state of the node …
alphabet and is equipped with a local map defining the evolution of the state of the node …
Intrinsic universality in automata networks III: On symmetry versus asynchrony
M Ríos-Wilson, G Theyssier - Theoretical Computer Science, 2024 - Elsevier
An automata network is a finite assembly of interconnected entities endowed with a set of
local maps defined over a common finite alphabet. These relationships are represented …
local maps defined over a common finite alphabet. These relationships are represented …