Temporal Retention of Information as a Biosignature

Terence P Kee; James mcCrum

Home/Archive/arXiv

arXiv · 2604.18359

Temporal Retention of Information as a Biosignature

Terence P Kee·James mcCrum

View original source ↗Read source document ↗Export metadata ↓

Abstract

Previous publications by the authors put forward the argument that Lifelike Cellular Automata can be treated as a bona fide example of livingness in and of themselves, not simply a toy analogue to biological life. Traits known to be indicative of biological life, biosignatures, were identified in informational form as particular outlier traits of the ruleset for the lifelike cellular automata known as Conways Game of Life. This publication reverses that logic, looking at a known outlier trait of Conways Game of Life, its very long-lasting evolutions, and using this to point towards temporal retention as an informational biosignature concept.

Explore related subjects

nlin.CG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Terence P Kee, James mcCrum. 2026-04-20. Temporal Retention of Information as a Biosignature. https://arxiv.org/abs/2604.18359

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

KEEP EXPLORING

Related papers

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; 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↗

arXiv2026

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG↗

arXiv2026

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG↗