Related papers: A weakly universal cellular automaton in the hepta…
For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^G\to A$ and then we show that it is naturally isomorphic to the monoid of cellular automata $\mathrm{CA}(G,…
State-of-the-art review of cellular automata, cellular automata for partial differential equations, differential equations for cellular automata and pattern formation in biology and engineering.
Let $G$ be a group and $A$ a set. A cellular automaton (CA) $\tau$ over $A^G$ is von Neumann regular (vN-regular) if there exists a CA $\sigma$ over $A^G$ such that $\tau \sigma\tau = \tau$, and in such case, $\sigma$ is called a…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility…
We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…
We consider the problem of embedding odometers in one-dimensional cellular automata. We show that (1) every odometer can be be embedded in a gliders with reflecting walls cellular automaton, which one depending on the odometer, and (2) an…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
The paper concerns the weak differentiability of weak solutions to two kinds of nonuniform nonlinear degenerate elliptic systems under the $p,q$-growth condition on the Heisenberg Group. We use the iteration to fractional difference…
A novel two-state, Reversible Cellular Automata (RCA) is described. This three-dimensional RCA is shown to be capable of universal computation. Additionally, evidence is offered that this RCA Is capable of universal construction.
We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}^d$ with random initial configurations. Confirming a conjecture of Balister, Bollob\'as, Przykucki and Smith, who proved the corresponding…
In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…
If A=Z/2, then A^Z is a compact abelian group. A `linear cellular automaton' is a shift-commuting endomorphism F of A^Z. If P is a probability measure on A^Z, then F `asymptotically randomizes' P if F^j P converges to the Haar measure as…
A cellular automaton with $n$ states may be used for construction of reversible second-order cellular automaton with $n^2$ states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
Let A be a commutative ring, and let \a = \frak{a} be a finitely generated ideal in it. It is known that a necessary and sufficient condition for the derived \a-torsion and \a-adic completion functors to be nicely behaved is the weak…
Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular…