Related papers: Symmetric Nonlinear Cellular Automata as Algebraic…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
We generalize the exact predictive regularity of symmetry groups to give an algebraic theory of patterns, building from a core principle of future equivalence. For topological patterns in fully-discrete one-dimensional systems, future…
We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is…
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to…
Over an arbitrary commutative ring $R$, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space $\mathbf{Q}(X)$ of quantum cellular automata (QCA) on a given metric space $X$. In most cases of…
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…
In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential…
We present a computable reformulation of Ruelle's linear response formula for chaotic systems. The new formula, called Space-Split Sensitivity or S3, achieves an error convergence of the order ${\cal O}(1/\sqrt{N})$ using $N$ phase points.…
The work introduces a 3D cellular automaton model for the spatial and crystallographic prediction of spherulite growth phenomena in polymers at the mesoscopic scale. The automaton is discrete in time, real space, and orientation space. The…
Using the N-body simulations of the AEMULUS Project, we construct an emulator for the non-linear clustering of galaxies in real and redshift space. We construct our model of galaxy bias using the halo occupation framework, accounting for…
Relation between global transition function and local transition function of a homogeneous one dimensional cellular automaton (CA) is investigated for some standard transition functions. It could be shown that left shift and right shift CA…
We introduce a new formulation of the real-spectral-triple formalism in non-commutative geometry (NCG): we explain its mathematical advantages and its success in capturing the structure of the standard model of particle physics. The idea,…
In this review, we discuss recent applications of the ab initio symmetry-adapted no-core shell-model (SA-NCSM) theory for study and prediction of structure and reactions of stable and unstable nuclei from light to medium mass range. We…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
We study spontaneous symmetry breaking in a one-dimensional driven two-species stochastic cellular automaton with parallel sublattice update and open boundaries. The dynamics are symmetric with respect to interchange of particles. Starting…
Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…
We consider the asymmetric simple exclusion process (ASEP) with open boundary condition at the left boundary, where particles exit at rate {\gamma} and enter at rate {\alpha} = {\gamma}{\tau}^2, and where {\tau} is the asymmetry parameter…