Related papers: Cellular Automation of Galactic Habitable Zone
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
We study a (1+1) dimensional probabilistic cellular automaton that is closely related to the Domany-Kinzel (DKCA), but in which the update of a given site depends on the state of {\it three} sites at the previous time step. Thus, compared…
The Fermi paradox highlights the dichotomy between the lack of physical contact with other civilizations and the expectation that technological civilizations are assumed likely to evolve in many locations in the Milky Way galaxy, given the…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
Partitioned cellular automata are known to be an useful tool to simulate linear and nonlinear problems in physics, specially because they allow for a straightforward way to define conserved quantities and reversible dynamics. Here we show…
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…
How coperation between self-interested individuals evolve is a crucial problem, both in biology and in social sciences, that is far from being well understood. Evolutionary game theory is a useful approach to this issue. The simplest model…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
The Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence of cooperation among competitive rational players. In this paper, we present the PD played in cells of one-dimension cellular automata,…
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
This paper considers a class of probabilistic cellular automata undergoing a phase transition with an absorbing state. Denoting by ${\mathcal{U}}(x)$ the neighbourhood of site $x$, the transition probability is $T(\eta_x = 1 |…
We introduce a stochastic cellular automaton as a model for culture and border formation. The model can be conceptualized as a game where the expansion rate of cultures is quantified in terms of their area and perimeter in such a way that…
Cellular automata provide models of parallel computation based on cells, whose connectivity is given by an action of a monoid on the cells. At each step in the computation, every cell is decorated with a state that evolves in discrete steps…
From photometric observations of elliptical galaxies, among which are both radio galaxies and radio-quiet objects, an investigation was carried out of the relationship `redshift -- age of the stellar system' $(\Delta z/\Delta t)$. By means…
We study a one-dimensional generalized probabilistic cellular automaton $E_{p, q}$ with universe $\mathbb Z$, alphabet $\mathcal A = \{0, 1\}$, parameters $p$ and $q$ such that $0 < p+q \leq 1$ and two neighbourhoods $\mathcal N_0 = \{0,…
We propose the characterization of binary cellular automata using a set of behavioral metrics that are applied to the minimal Boolean form of a cellular automaton's transition function. These behavioral metrics are formulated to satisfy…
We propose a method to generate `genetically-modified' (GM) initial conditions for high-resolution simulations of galaxy formation in a cosmological context. Building on the Hoffman-Ribak algorithm, we start from a reference simulation with…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…