Related papers: On complexity of colloid cellular automata
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
Fungal automata are a variation of the two-dimensional sandpile automaton of Bak, Tang, and Wiesenfeld (Phys. Rev. Lett. 1987). In each step toppling cells emit grains only to some of their neighbors chosen according to a specific update…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…
Self-sustaining nonlinear oscillators of practically any type can function as latches and registers if Boolean logic states are represented physically as the phase of oscillatory signals. Combinational operations on such phase-encoded logic…
We present a derivation of a formula that gives dynamics of an integrable cellular automaton associated with crystal bases. This automaton is related to type D affine Lie algebra and contains usual box-ball systems as a special case. The…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…
Active particle systems are a class of non-equilibrium systems composed of self-propelled Brownian particles; through interactions between particles within the system, a variety of intriguing collective behaviors can emerge. Based on…
Because of consuming energy to drive their motion, systems of active colloids are intrinsically out of equilibrium. In the past decade, a variety of intriguing dynamic patterns have been observed in systems of active colloids, and they…
Continuous cellular automata are rocketing in popularity, yet developing a theoretical understanding of their behaviour remains a challenge. In the case of Lenia, a few fundamental open problems include determining what exactly constitutes…
A recently developed density functional method, within Hohenberg-Kohn-Sham framework, is used for faithful description of atoms, molecules in Cartesian coordinate grid, by using an LCAO-MO ansatz. Classical Coulomb potential is obtained by…
Electrostatic interactions between macroions largely govern the equilibrium thermodynamic and dynamical properties of charge-stabilized colloidal suspensions and polyelectrolyte solutions. Predicting the properties of such complex,…
Dynamical systems theory and complexity science provide powerful tools for analysing artificial agents and robots. Furthermore, they have been recently proposed also as a source of design principles and guidelines. Boolean networks are a…
Self-organization phenomena in ensembles of self-propelled particles open pathways to the synthesis of new dynamic states not accessible by traditional equilibrium processes. The challenge is to develop a set of principles that facilitate…
In this work we introduce a deterministic scheme of synchronization of linear and nonlinear cellular automata (CA) with complex behavior, connected through a master-slave coupling. By using a definition of Boolean derivative, we use the…
The regulation of the cell state is a complex process involving several components. These complex dynamics can be modeled using Boolean networks, allowing us to explain the existence of different cell states and the transition between them.…
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…
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…
An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group $\mathbb{Z}/m\mathbb{Z}$. In this paper, we consider simplices appearing in the orbits generated from…
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…