Search arXivSearch

arXiv · 2008.05905

The Effects of Interaction Functions Between Two Cellular Automata

Abstract

Biological systems are notorious for complex behavior within short timescales (e.g. metabolic activity) and longer time scales (e.g. evolutionary selection), along with their complex spatial organization. Because of their complexity and their ability to innovate with respect to their environment, living systems are considered to be open-ended. Historically, it has been difficult to model open-ended evolution and innovation. As a result, our understanding of the exact mechanisms that distinguish open-ended living systems from non-living ones is limited. One of the biggest barriers is understanding how multiple, complex parts within a single system interact and contribute to the complex, emergent behavior of the system as a whole. How do interactions between parts of a system lead to more complex behavior of the system as a whole? This paper presents two interacting cellular automata (CA) as an abstract model to address the effects of complex interactions between two individual entities embedded within a larger system. Unlike elementary CA, each CA changes its update rules as a function of the system's state as a whole. The resulting behavior of the two-CA system suggests that complex interaction functions between the two CA have little to no effect on the complexity of each individual CA behavior and structure. However, having an interaction function that is random results in open-ended evolution regardless of the specific type of state-dependency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alyssa M Adams. 2021-09-13. The Effects of Interaction Functions Between Two Cellular Automata. https://arxiv.org/abs/2008.05905

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG