Related papers: Cellular automaton supercolliders
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
In this paper, we give an elaborate and understandable review of traffic cellular automata (TCA) models, which are a class of computationally efficient microscopic traffic flow models. TCA models arise from the physics discipline of…
In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton…
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
Topological transitivity is a fundamental notion in topological dynamics and is widely regarded as a basic indicator of global dynamical complexity. For general cellular automata, topological transitivity is known to be undecidable. By…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
Actin is a globular protein which forms long filaments in the eukaryotic cytoskeleton, whose roles in cell function include structural support, contractile activity to intracellular signalling. We model actin filaments as two chains of…
We investigate the entanglement of a ladder of spins formed by two sublattices, a ''cluster'' chain and the ''environment'', consisting of independent spins, both coupled by an exchange interaction and evolving under a unitary discrete time…
We introduce a novel framework of reservoir computing, that is capable of both connectionist machine intelligence and symbolic computation. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto…
The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma…
We study numerically synchronization phenomena of spatiotemporal structures, including chimera states, in a two layer network of nonlocally coupled nonlinear chaotic discrete-time systems. Each of the interacting ensembles represents a one…
In this paper I describe a cellular automaton model of a multi-species ecosystem, suitable for the study of emergent properties of macroevolution. Unlike majority of ecological models, the number of coexisting species is not fixed. Starting…
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…
For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…