Related papers: Further results on generalized cellular automata

Let $G$ be a group. Let $X$ be a connected algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of $K$-points of $X$. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular…

Gauge-invariance is a mathematical concept that has profound implications in Physics---as it provides the justification of the fundamental interactions. It was recently adapted to the Cellular Automaton (CA) framework, in a restricted case.…

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…

The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…

This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…

Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…

Let $(W,S)$ be a Coxeter system, let $G$ be a finite solvable group of automorphisms of $(W,S)$ and let $\varphi$ be a weight function which is invariant under $G$. Let $\varphi_G$ denote the weight function on $W^G$ obtained by restriction…

For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes.…

When $G$ is an arbitrary group and $V$ is a finite-dimensional vector space, it is known that every bijective linear cellular automaton $\tau \colon V^G \to V^G$ is reversible and that the image of every linear cellular automaton $\tau…

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

In this work we provide analytic results of infinite one-dimensional cellular automaton(CA). By realizing symbolic products, we investigate a subclass of infinite CA and prove analytically that within this subclass the only allowed…

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…

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…

For any infinite transitive sofic shift $X$ we construct a reversible cellular automaton (i.e. an automorphism of the shift $X$) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing…

Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…

If M is a monoid (e.g. the lattice Z^D), and A is an abelian group, then A^M is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. If F is diffusive, and…

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…

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…

This paper explains how any nondeterministic automaton for a regular language $L$ gives rise to a one-dimensional oriented Topological Quantum Field Theory (TQFT) with inner endpoints and zero-dimensional defects labelled by letters of the…

We describe homomorphisms $\varphi:H\rightarrow G$ for which the codomain is acylindrically hyperbolic and the domain is a topological group which is either completely metrizable or locally countably compact Hausdorff. It is shown that, in…