Decision problems for cellular automata and their semigroups

Kolmogorov complexity and cellular automata classification

We study integrable spin chains and quantum and classical cellular automata with interaction range ℓ≥3. This is a family of integrable models for which there was no general theory so far. We develop an algebraic framework for such models, generalizing known methods from nearest-neighbor interacting chains. This leads to a new integrability condition for medium-range Hamiltonians, which can be used to classify such models. A partial classification is performed in specific cases, including U(1)-symmetric three-site interacting models, and Hamiltonians that are relevant for interaction-round-a-face models. We find a number of models which appear to be new. As an application we consider quantum brickwork circuits of various types, including those that can accommodate the classical elementary cellular automata on light cone lattices. In this family we find that the so-called Rule150 and Rule105 models are Yang-Baxter integrable with three-site interactions. We present integrable quantum deformations of these models, and derive a set of local conserved charges for them. For the famous Rule54 model we find that it does not belong to the family of integrable three-site models, but we cannot exclude Yang-Baxter integrability with longer interaction ranges.

In this paper, cellular automata (CA) are viewed as an abstract model for distributed computing. The author argues that the classical CA model must be modified in several important respects to become a relevant model for large-scale MAS. The paper first proposes sequential cellular automata (SCA) and formalizes deterministic and nondeterministic versions of SCA. The author then analyzes differences in possible dynamics between classical parallel CA and various SCA models. The analysis in this paper focuses on one-dimensional parallel and sequential CA with node update rules restricted to simple threshold functions, as arguably the simplest totalistic, yet non-linear (and non-affine) update rules. The author identifies properties of asymptotic dynamics that can be proven to be entirely due to the assumption of perfect synchrony in classical, parallel CA. Finally, the paper discusses what an appropriate CA-based abstraction would be for large-scale distributed computing, insofar as the inter-agent communication models. In that context, the author proposes genuinely asynchronous CA and discusses main differences between genuinely asynchronous CA and various weakly asynchronous sequential CA models found in the literature.

There Can Be Only One: Reversible Cellular Automata and the Conservation of Genki

We prove that a countable group G can be embedded into a two-generator simple group S which is an amalgamated free product of groups G * F and F, where F and F are free groups on two generators.S is also the product of two commuting free subgroups.If G has solvable word problem, then we can construct a recursive presentation for S.1. Introduction.It is well known that every countable group is a subgroup of a simple two-generator group (see [3] and [7]).The main result of our paper is Theorem A. (a) A countable group G can be embedded into a simple two-generator group S which is an amalgamated free product of G * Fx and F, where F and Fx are both free groups on two generators.S is also the product of two commuting free subgroups.(b) If G has solvable word problem, we can construct the group S of (a) with a recursive presentation.It was first shown by R. J. Thompson [8] by a construction completely different from ours that a countable group with solvable word problem is a subgroup of a recursively presented finitely generated simple group.Our construction of the group S is similar to the construction of the simple free products of R. Camm [1], or see [6] for a slightly simplified version.2. The construction of the group S. Let 77 be a countable infinite group with an element x of order at least 5, and assume that the elements of 77 are numbered by the integers, 77 = {g" i G Z}, such that g0 = 1, gx = x, g2 = x2, g3 = x3, g4 = x4.Let A = (a) and F = (b,c) be free groups on a and b, c, respectively.Then the subgroup U of A * H generated by the elements of the form ", = aW *'eZ-{0}, where p is a permutation of Z -{0}, is a free group freely generated by the elements u" / g Z -{0}, with transversal AinA*H.Similarly, the elements Vj = bjcu\ 7GZ-{0), of F, where a is a second permutation of Z -{0}, freely generate a free subgroup V of F with transversal B = (b).

Let G be a finitely presented group with solvable word problem. It is of some interest to ask which other decision problems must necessarily be solvable for such a group. Thus it is easy to see that there exist effective procedures to determine whether or not such a group is trivial, or nilpotent of a given class. On the other hand, the conjugacy problem need not be solvable for such a group, for Fridman [5] has shown that the word problem is solvable for the group with unsolvable conjugacy problem given by Novikov [9].

This book presents the foundation and development of the theory of cellular automata identification and its application to natural systems. It first sets out the known and proposes the new classes of cellular automata. Numerous examples are included for ease of understanding. It then deals with the designs of algorithms for cellular automata identification. Conceptual questions of automata theory are next addressed and the focus is shifted from synthesis to analysis and from pronostication to accurate factorization. Finally, the author discusses a number of naturally occuring specific instances with a view to expanding and transforming current ideas on cellular automata practice.

Collective dynamics in multicellular systems such as biological organs and tissues plays a key role in biological development, regeneration, and pathological conditions. Collective tissue dynamics—understood as population behaviour arising from the interplay of the constituting discrete cells—can be studied with on- and off-lattice agent-based models. However, classical on-lattice agent-based models, also known as cellular automata, fail to replicate key aspects of collective migration, which is a central instance of collective behaviour in multicellular systems. To overcome drawbacks of classical on-lattice models, we introduce an on-lattice, agent-based modelling class for collective cell migration, which we call biological lattice-gas cellular automaton (BIO-LGCA). The BIO-LGCA is characterised by synchronous time updates, and the explicit consideration of individual cell velocities. While rules in classical cellular automata are typically chosen ad hoc, rules for cell-cell and cell-environment interactions in the BIO-LGCA can also be derived from experimental cell migration data or biophysical laws for individual cell migration. We introduce elementary BIO-LGCA models of fundamental cell interactions, which may be combined in a modular fashion to model complex multicellular phenomena. We exemplify the mathematical mean-field analysis of specific BIO-LGCA models, which allows to explain collective behaviour. The first example predicts the formation of clusters in adhesively interacting cells. The second example is based on a novel BIO-LGCA combining adhesive interactions and alignment. For this model, our analysis clarifies the nature of the recently discovered invasion plasticity of breast cancer cells in heterogeneous environments.

We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric characterization of finite presentability for left cancellative monoids. We also give examples to show that this characterization does not extend to monoids in general, and indeed that properties such as solvable word problem are not isometry invariants for general monoids.

Quantum field theoretic behavior of a deterministic cellular automaton

We introduce a special new class of cellular automata(CA) whose inter-cell communication is restricted to 1-bit. Several design examples for 1-bit inter-cell communication cellular algorithms are g...

The firing squad synchronization problem on CA with multiple updating cycles

Classical Cellular automata (CA) have long been used as a paradigm of modelling complex systems, yet they are frequently hard to scale to geometric symmetries and to be stable on a variety of initial conditions. A more recent alternative is the Neural Cellular Automata (NCA) where neural networks are used to learn update rules instead of being defined by them. Standard NCA models are however often unstable in the sense that they lose meaningful structures in long-term evolution, particularly in high-dimensional spaces. This study suggests a new NCA architecture with group-equivariant convolutions and diffusion-based regularization to increase stability, scalability, and symmetry preservation. The suggested system combines deep learning concepts of geometry with the principles of NCA system that allows consistent production of emergent patterns with respect to various initial states. There is better pattern coherence, generalization, and long-term stability, as is seen in experimental assessments than with baseline NCA models. The applications of the framework include generative design, biological growth modelling and material structure simulation and provide a scalable and generalizable method to self-organizing systems.

Cellular automata based traffic model that allows the cars to move with a small velocity during congestion

We study a quantum cellular automaton (QCA) whose time-evolution is defined from global transition function of classical cellular automata (CA). In order to investigate natural transformations from CA to QCA, the present QCA includes CA with Wolfram's rule 150 and 105 as special cases. We firstly compute the time-evolution of the QCA and examine its statistical properties. As a basic statistical value, the probability of finding an active cell averaged over a spatial-temporal space is introduced, and the difference between CA and QCA is considered. In addition, it is shown that statistical properties in QCA are related to the classical trajectory in the configuration space.