Search arXivSearch

arXiv · 2305.13784

Implementation of Lenia as a Reaction-Diffusion System

Abstract

The relationship between reaction-diffusion (RD) systems, characterized by continuous spatiotemporal states, and cellular automata (CA), marked by discrete spatiotemporal states, remains poorly understood. This paper delves into this relationship through an examination of a recently developed CA known as Lenia. We demonstrate that asymptotic Lenia, a variant of Lenia, can be comprehensively described by differential equations, and, unlike the original Lenia, it is independent of time-step ticks. Further, we establish that this formulation is mathematically equivalent to a generalization of the kernel-based Turing model (KT model). Stemming from these insights, we establish that asymptotic Lenia can be replicated by an RD system composed solely of diffusion and spatially local reaction terms, resulting in the simulated asymptotic Lenia based on an RD system, or "RD Lenia". However, our RD Lenia cannot be construed as a chemical system since the reaction term fails to satisfy mass-action kinetics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Kojima, Takashi Ikegami. 2023-05-23. Implementation of Lenia as a Reaction-Diffusion System. https://doi.org/10.1162/isal_a_00638

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