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

• URL: http://arxiv.org/abs/2607.09211v1
• Date: Fri, 10 Jul 2026 08:59:25 GMT
• Title: Co-evolution of self-replication and function in a digital primordial soup
• Abstract summary: Self-replication can emerge spontaneously within digital primor soupsdial''<n>This paper investigates the co-evolution of this emergent self-replication alongside problem-solving capabilities.
• Score: 4.677439892464849
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Tapes Together Strong: The Co-evolution of Computation and Cooperation [13.768734687722427]
  We introduce Autopoietic Game Theory, a model where social interactions, replication mechanisms, and their associated computational costs are endogenous and simultaneously co-evolving.<n>We show that embedding a social dilemma directly into the physics of computation can favor the emergence of self-replicating, cooperative strategies.<n>Results suggest that coupling an agent's capacity for computation to its available energy transforms cooperation into a dominant scaffolding for building sustainable, self-organizing systems.
  arXiv  Detail & Related papers  (2026-09-09T20:38:56Z)
• Prospective Compression in Human Abstraction Learning [7.788051955651714]
  We propose and test the hypothesis that in non-stationary domains human library learning selects abstractions prospectively.<n>We show that human abstraction behavior reflects sensitivity to latent, non-stationary structure in the task-generating process.
  arXiv  Detail & Related papers  (2026-05-11T04:54:23Z)
• From Brain Models to Executable Digital Twins: Execution Semantics and Neuro-Neuromorphic Systems [51.82266520875928]
  This survey introduces physically constrained executability as a unifying perspective for comparing approaches at the level of execution.<n>I propose a taxonomy of execution regimes ranging from isolated offline models to coordinated co-simulation, to continuously executing digital twins sustained by online data.<n>The executability concept clarifies why accuracy alone is insufficient, and motivates an agenda centered on semantic interoperability, hybrid-time correctness, evaluation protocols, scalable assimilation, and safe closed-loop validation.
  arXiv  Detail & Related papers  (2026-04-15T07:34:46Z)
• Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction [37.95302339577743]
  We show that when random, non self-replicating programs are placed in an environment lacking any explicit fitness landscape, self-replicators tend to arise. We also show how increasingly complex dynamics continue to emerge following the rise of self-replicators.
  arXiv  Detail & Related papers  (2024-06-27T11:34:35Z)
• Replicable Reinforcement Learning [15.857503103543308]
  We provide a provably replicable algorithm for parallel value iteration, and a provably replicable version of R-max in the episodic setting. These are the first formal replicability results for control problems, which present different challenges for replication than batch learning settings.
  arXiv  Detail & Related papers  (2023-05-24T16:05:15Z)
• Incremental procedural and sensorimotor learning in cognitive humanoid robots [52.77024349608834]
  This work presents a cognitive agent that can learn procedures incrementally. We show the cognitive functions required in each substage and how adding new functions helps address tasks previously unsolved by the agent. Results show that this approach is capable of solving complex tasks incrementally.
  arXiv  Detail & Related papers  (2023-04-30T22:51:31Z)
• Towards replicated algorithms [2.535671322516818]
  The paper introduces the so-called replicated algorithms, inspired by the concept of developing a human brain. Similar to the human brain, where the process of thinking is strongly parallel, replicated algorithms are also capable of replicating themselves and solving problems in parallel.
  arXiv  Detail & Related papers  (2023-03-31T08:56:54Z)
• Score-based Causal Representation Learning with Interventions [54.735484409244386]
  This paper studies the causal representation learning problem when latent causal variables are observed indirectly. The objectives are: (i) recovering the unknown linear transformation (up to scaling) and (ii) determining the directed acyclic graph (DAG) underlying the latent variables.
  arXiv  Detail & Related papers  (2023-01-19T18:39:48Z)
• Compositional Generalization and Decomposition in Neural Program Synthesis [59.356261137313275]
  In this paper, we focus on measuring the ability of learned program synthesizers to compositionally generalize. We first characterize several different axes along which program synthesis methods would be desired to generalize. We introduce a benchmark suite of tasks to assess these abilities based on two popular existing datasets.
  arXiv  Detail & Related papers  (2022-04-07T22:16:05Z)
• End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking [52.05847268235338]
  We show how machine learning systems can perform logical extrapolation without overthinking problems. We propose a recall architecture that keeps an explicit copy of the problem instance in memory so that it cannot be forgotten. We also employ a progressive training routine that prevents the model from learning behaviors that are specific to number and instead pushes it to learn behaviors that can be repeated indefinitely.
  arXiv  Detail & Related papers  (2022-02-11T18:43:28Z)
• X-volution: On the unification of convolution and self-attention [52.80459687846842]
  We propose a multi-branch elementary module composed of both convolution and self-attention operation. The proposed X-volution achieves highly competitive visual understanding improvements.
  arXiv  Detail & Related papers  (2021-06-04T04:32:02Z)
• Adaptive Rational Activations to Boost Deep Reinforcement Learning [68.10769262901003]
  We motivate why rationals are suitable for adaptable activation functions and why their inclusion into neural networks is crucial. We demonstrate that equipping popular algorithms with (recurrent-)rational activations leads to consistent improvements on Atari games.
  arXiv  Detail & Related papers  (2021-02-18T14:53:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.