Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.3657

Pattern Formation without Favored Local Interactions

Alexander D. Wissner-Gross
View original source ↗Read source document ↗Export metadata ↓

Abstract

Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly understood. Here we report the first known analysis of the equally weighted ensemble of all elementary cellular automata (ECA) rules. Ensemble dynamics reveal persistent, localized, non-interacting patterns, rather than homogenization. The patterns are strongly correlated by velocity and have a quasi-linear dependence on initial conditions. Dispersion from a single initial site generates peaks traveling at low-denominator fractional velocities, some of which are not discernible in individual rules, suggesting collective excitation. Further analysis of the time-evolved rule space shows the 256 ECA rules can be represented by only approximately 111 principal components. These results suggest the rather surprising conclusion that rich self-assembly is possible without favoring particular local interactions.

Explore related subjects

nlin.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander D. Wissner-Gross. 2007-07-25. Pattern Formation without Favored Local Interactions. https://arxiv.org/abs/0707.3657

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

KEEP EXPLORING

Related papers

arXiv2026

Computing functions through the orbits of dynamical systems: the case of cellular automata

Computing a function traditionally involves constructing a formula, circuit, or program specifically designed for that function. But could a single, fixed computational structure generate an entire universe of functions simply by evolving over time? More generally, to what extent can the expressive power of a dynamical system be measured by the functions emerging along its orbits? We investigate this question in a setting where computation is driven by repeated application of one elementary operation, uniformly distributed in space and unchanged over time. Using cellular automata as a model of homogeneous dynamics, we consider systems whose states represent Boolean functions rather than Boolean values. Starting from a simple configuration containing only input variables and constants, the system evolves autonomously, generating new functions at different spatial positions and times. Unlike conventional function synthesis, no function-specific circuit, program, or operation sequence is constructed: the architecture remains fixed, and functions are identified by their space-time location. We ask which elementary rules can generate every Boolean function of a given number of variables along a single orbit, and whether this functional universality persists as the number of variables increases. We develop algebraic and dynamical criteria separating universal from non-universal behavior, and obtain a complete classification of elementary-rule symmetry classes for three-variable functions. Particularly intriguing is Rule 30, for which simple initial configurations generate all Boolean functions of up to five variables, suggesting possible universality for arbitrarily many variables. Our results support a view of computation in which functional diversity arises not from increasingly elaborate architectures, but from the space-time evolution of a single simple dynamical law.

nlin.CG↗
arXiv2026

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

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically. 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↗
arXiv2026

Frobenius Revivals in Laplacian Cellular Automata: Replication, Entropy, and Information Recovery

We investigate Frobenius revivals in prime-modulus Laplacian cellular automata. The Frobenius identity yields exact superpositions of translated, coefficient-weighted seed copies at prime-power times; we distinguish this algebraic replication from their geometric separation. We investigate seed recovery from separated replicas and evaluate the correction of independent symbol errors introduced during transmission of encoded configurations. For the diagonal neighborhood, we determine the exact periods of moving corner operators on square windows and establish sufficient conditions for recovering any binary seed under a binary--ternary--binary schedule. The results connect prime-power algebraic structure with spatial pattern formation and precisely delimited forms of information recovery.

nlin.CG↗