Related papers: Kolmogorov Complexity and the Garden of Eden Theor…

Let $G$ be an amenable group and let $X$ be an irreducible complete algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $X$ and let $\tau \colon A^G \to A^G$ be an algebraic cellular automaton…

We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an…

Garden of Eden (GOE) states in cellular automata are grid configurations which have no precursors, that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest…

Let $G$ be a group. Let $X$ be an algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of rational points of $X$. We study algebraic group cellular automata $\tau \colon A^G \to A^G$ whose local defining map is…

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…

Let $\Gamma$ be a countable abelian group and $f \in \Z[\Gamma]$, where $\Z[\Gamma]$ denotes the integral group ring of $\Gamma$. Consider the Pontryagin dual $X_f$ of the cyclic $\Z[\Gamma]$-module $\Z[\Gamma]/\Z[\Gamma] f$ and suppose…

Let $\Gamma$ be a countable Abelian group and $f \in \Z[\Gamma]$, where $\Z[\Gamma]$ denotes the integral group ring of $\Gamma$. Consider the Pontryagin dual $X_f$ of the cyclic $\Z[\Gamma]$-module $\Z[\Gamma]/\Z[\Gamma] f$ and suppose…

Let $G$ be an amenable group and let $V$ be a finite-dimensional vector space over an arbitrary field $\K$. We prove that if $X \subset V^G$ is a strongly irreducible linear subshift of finite type and $\tau \colon X \to X$ is a linear…

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…

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that…

In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking…

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 establish a Garden of Eden theorem for expansive algebraic actions of amenable groups with the weak specification property, i.e. for any continuous equivariant map T from the underlying space to itself, T is pre-injective if and only if…

Non-uniform cellular automata (NUCA) are an extension of cellular automata with multiple local rules in different cells. We show that if the distribution of local rules is uniformly recurrent, or recurrent in the one-dimensional case, the…

We review topics in the theory of cellular automata and dynamical systems that are related to the Moore-Myhill Garden of Eden theorem.

We prove that on B-free subshifts, with B satisfying the Erd\"os condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.

This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-random configuration. More precisely, we investigate the…

A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this…

Let $G$ be a group and $A$ a set equipped with a collection of finitary operations. We study cellular automata $\tau : A^G \to A^G$ that preserve the operations of $A^G$ induced componentwise from the operations of $A$. We show that $\tau$…

We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…