CORTEXA
← Browse
arxivcs.NE2026-07-10

Co-evolution of self-replication and function in a digital primordial soup

Francesco Cicala, Eyvind Niklasson, Ettore Randazzo, Sami Boukortt, Alessio Basti, Mayalen Etcheverry, Rif A. Saurous, Ben Laurie, James Manyika, Blaise Aguera-Arcas, Blake Richards

While traditional evolutionary algorithms hard-code reproduction, self-replication can emerge spontaneously within digital ``primordial soups''. This paper investigates the co-evolution of this emergent self-replication alongside problem-solving capabilities. We initialize a population of random 32-byte Z80 assembly programs, requiring self-replication to arise purely through random assembly-level mutations and pairwise program interactions. To link these behaviors, we introduce a task-based validation step: correctly evaluating a polynomial raises a program's interaction probability above a baseline rate. Our experiments yield four primary findings. First, self-replication and mathematical problem-solving successfully co-evolve from initial randomness. Second, the pressure to compute accelerates the emergence of compact, robust reproductive architectures that preserve memory for task execution. Third, applying metabolic constraints increases the likelihood that programs evolve conditional halting, terminating early during validation while bypassing the halt during interaction to execute block-copy replication. Finally, when programs are partitioned into spatial task niches, spontaneous self-replication generates an emergent learning curriculum, utilizing simple solutions as stepping stones toward complex polynomials. Altogether, these results demonstrate an interactive feedback loop: environmental task demands actively shape the physical architecture of self-replication, while spontaneous replication alters the evolutionary trajectory of functional problem-solving.

View free PDFSource page

Related papers

arxivcs.NE2026-06-29

Semantics-Aware Bilevel Co-Evolution: Towards Automated Multicomponent Algorithm Design

Zhiyao Zhang, Shenghao Wu, Xingyu Wu, Kay Chen Tan

LLM-assisted evolutionary search (LES) has emerged as a promising paradigm for automated algorithm design. However, existing methods usually suffer from two inherent limitations when facing the automated design of real-world complex algorithms that usually consist of multiple com…

View free PDFSource page
arxivcs.NE2026-07-01

BFF: Simple explanations for complex phenomena

Charlotte Knierim, Luca Versari, Robert Obryk, Blaise Agüera y Arcas, Rif A. Saurous

The ''Computational Life'' paper (Agüera y Arcas et al., 2024) argues that paired interactions in a computational soup are an effective way to find self-replicators. In this work, aided by recent developments in self-replicator detection, we explore the alternate hypothesis that…

View free PDFSource page
arxivcs.NEq-bio.PE2026-07-03

Life as Plasmas: Autonomy and Interactivism in-materio

Nicolás Hinrichs, Mahault Albarracin, Felipe Engelberger, Leonardo Christov-Moore, Daniel Polani

When is a material system a candidate for life at all? We argue that this question is prior to behavior, functional architecture, or computational capacity, and that at root it is one of physical admissibility. We develop a framework in which minimal autonomy, taken in the intera…

View free PDFSource page
arxivcs.ARcs.ETcs.NE2026-06-26

Co-Optimization of Analog Kolmogorov-Arnold Networks for Low-Power Function Approximation in Flexible Electronics

Paula Carolina Lozano Duarte, Georgios Zervakis, Mehdi Tahoori, Sani Nassif

Wearable devices and Internet of Things (IoT) sensors require on-sensor processing of biosignals and environmental data, including computationally demanding operations such as nonlinear activation functions for neural network inference, sensor calibration curves to map raw readin…

View free PDFSource page
arxivcs.NEcs.AI2026-07-31

Linear Proposal Operators and Stochastic Search Geometry in SOMA and Differential Evolution

Vojtěch Novák, Ivan Zelinka

Swarm and evolutionary algorithms are usually analyzed as complete procedural systems in which nonlinear selection, replacement, and adaptation obscure simpler structure within candidate generation. This paper introduces an operator--selection factorization that separates objecti…

View free PDFSource page