Related papers: Von Neumann regularity, split epicness and element…
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
Suppose R is a finite commutative ring of prime characteristic, A is a finite R-module, M:=Z^D x N^E, and F is an R-linear cellular automaton on A^M. If mu is an F-invariant measure which is multiply shift-mixing in a certain way, then we…
We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
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, we define and study a particular case of von Neumann regular notion called a weak von Neumann regular ring. It shown that the polynomial ring $R[x]$ is weak von Neumann regular if and only if $R$ has exactly two idempotent…
If $R$ is a regular and semiartinian ring, it is proved that the following conditions are equivalent: (1) $R$ is unit-regular, (2) every factor ring of $R$ is directly finite, (3) the abelian group $K_0(R)$ is free and admits a basis which…
von Neumann algebras have been playing an increasingly important role in the context of gauge theories and gravity. The crossed product presents a natural method for implementing constraints through the commutation theorem, rendering it a…
Let M be a monoid (e.g. the lattice Z^D), and A an abelian group. A^M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. Let mu be a (possibly…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
Wolfram has provided a qualitative classification of cellular automata(CA) rules according to which, there exits a class of CA rules (called Class 4) which exhibit complex pattern formation and long-lived dynamical activity (long…
We consider a condition for non-degenerate commuting squares of matrix algebras (finite dimensional von Neumann algebras) called the \emph{span condition}, which in the case of the $n$-dimensional standard spin models is shown to be…
Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
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…
Let $G$ be a group and let $A$ be a finite-dimensional vector space over an arbitrary field $K$. We study finiteness properties of linear subshifts $\Sigma \subset A^G$ and the dynamical behavior of linear cellular automata $\tau \colon…
Hochman asked whether there exists a cellular automaton $F$ such that every cellular automaton is a factor of $F$ in the dynamical sense. In particular, we do not require the factor map to commute with the spatial shifts. We show that no…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…