Related papers: Symmetric Nonlinear Cellular Automata as Algebraic…
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…
We investigate quantum cellular automata (QCA) on one-dimensional spin systems defined over a subalgebra of the full local operator algebra - the symmetric subalgebra under a finite Abelian group symmetry $G$. For systems where each site…
Let $A=\oplus_{i\in \mathbb{Z}}A_i$ be a finite dimensional graded symmetric cellular algebra with a homogeneous symmetrizing trace of degree $d$. We prove that $A_{-d}$ contains the Higman ideal $H(A)$ of the center of $A$ and $\dim…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Let $R$ be an integral domain and $A$ a symmetric cellular algebra over $R$ with a cellular basis $\{C_{S,T}^\lam \mid \lam\in\Lambda, S,T\in M(\lam)\}$. We will construct an ideal $L(A)$ of the center of $A$ and prove that $L(A)$ contains…
We discuss emulators from the ab initio symmetry-adapted no-core shell-model framework for studying the formation of alpha clustering and collective properties without effective charges. We present a new type of an emulator, one that…
We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic…
Cellular automata generate spatially extended, temporally persistent emergent structures from local update rules. No general method derives the mechanisms of that generation from the rule itself; existing tools reconstruct structure from…
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
The precision of Cosmic Microwave Background (CMB) experiments, specifically its lensing reconstruction, has reached the limit where non-linear corrections cannot be ignored. Neglecting these corrections results in biased constraints on…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
Clear evidence for symplectic symmetry in low-lying states of $^{12}$C and $^{16}$O is reported. Eigenstates of $^{12}$C and $^{16}$O, determined within the framework of the no-core shell model using the JISP16 $NN$ realistic interaction,…
To respect physics and nature, cellular automata (CA) models of self-organisation, emergence, computation and logical universality should be isotropic, having equivalent dynamics in all directions. We present a novel paradigm, the iso-rule,…
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the…