Related papers: Cellular automata in operational probabilistic the…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their…
In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
Automata networks are mappings of the form f : Q Z $\rightarrow$ Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its…
We show that quantum cellular automata naturally form the degree-zero part of a coarse homology theory. The recent result of Ji and Yang that the space of QCA forms an Omega-spectrum in the sense of algebraic topology is a direct…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…
The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, computability logic is built on the notion of events/games, which…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the…
It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks. Random Boolean networks are a generalization of two-state cellular automata, where the interconnection…