Pith. sign in

REVIEW 2 major objections 6 minor 51 references

In a digital soup of random assembly programs, self-replication and polynomial-solving co-evolve and reshape each other.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-13 04:39 UTC pith:IZQ3S7O5

load-bearing objection Solid ALife experiment: task pressure really does reshape spontaneous Z80 replicators and sparse niches yield a curriculum; main limit is the rich fixed ISA, already flagged by the authors. the 2 major comments →

arxiv 2607.09211 v1 pith:IZQ3S7O5 submitted 2026-07-10 cs.NE

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
show 3 more authors
James Manyika Blaise Aguera-Arcas Blake Richards
This is my paper
classification cs.NE
keywords Artificial LifeSpontaneous ReplicationComputational EvolutionAutomated Curriculacompetence-gated interactionZ80 assemblymetabolic constraintsspatial niches
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Traditional evolutionary algorithms hard-code how programs reproduce. This paper instead starts with random 32-byte Z80 assembly programs and requires self-replication to arise only from mutations and pairwise interactions. A validation step links the two capacities: correctly evaluating a niche polynomial raises a program's chance of interacting, but never itself supplies a copy command. From this setup the authors show four results: replication and task solutions co-emerge; the demand to compute accelerates the shift from bulky Load-Push replicators to compact LDIR/LDD block-copy machines that leave tape free for code; metabolic penalties favor conditional halting that distinguishes validation from interaction; and spatial niches with sparse cross-pollination spontaneously generate a curriculum in which simple polynomial solutions seed harder ones. The paper's claim is that heredity and function are not independent modules but co-evolve under an interactive feedback loop.

Core claim

Self-replication and mathematical problem-solving successfully co-evolve from pure random initialization under competence-gated interaction. Environmental pressure to evaluate polynomials actively reshapes reproductive architecture, accelerating compact, mutationally robust replicators that leave memory free for computation, while spontaneous replication plus spatial niches produces an emergent curriculum that lets simple solutions act as stepping stones to higher-degree polynomials.

What carries the argument

Competence-gated interaction: a program that correctly evaluates its niche polynomial on three sampled inputs receives elevated interaction probability (optionally discounted by a metabolic cost on instruction count), yet the system never supplies a copy primitive; replication must still be executed by the program's own assembly instructions during pairwise tape concatenation.

Load-bearing premise

The claim that self-replication is truly spontaneous rests on a fixed microprocessor instruction set whose computational meanings are already predefined, so the 'primordial soup' is not free of prior semantics.

What would settle it

Remove the task-validation gate (or replace it with uniform random interaction) and measure whether compact LDIR/LDD replicators still overtake Load-Push architectures on the same timescale, and whether high-degree polynomials still appear under identical niche and pollination rates.

Watch this falsifier — get emailed when new claim-graph text bears on it.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The paper studies co-evolution of spontaneous self-replication and polynomial evaluation in a population of random 32-byte Z80 programs under competence-gated pairwise interaction. Task success raises interaction probability but never supplies a copy primitive; replication must be discovered via assembly execution. Four findings are reported: (i) replication and task-solving co-emerge from random initialization; (ii) task pressure accelerates the Load-Push → compact LDIR/LDD transition, supported by LDIR-family ablation and mutational-robustness assays; (iii) metabolic penalties promote early/conditional HALT; (iv) spatial niches with moderate cross-niche pollination produce an emergent curriculum for higher-degree polynomials, outperforming panmictic/single-task and smooth-fitness controls. Methods detail multi-seed protocols (typically n=100–200), statistical tests, and replicator counting.

Significance. If the results hold, the work is a clear advance over platforms that hard-code reproduction (e.g., Avida-style copy rewards) and over prior unseeded primordial-soup models that stop at replication alone. The interactive feedback loop—task demand reshaping reproductive architecture, and spatial replication dynamics scaffolding harder functions—is of genuine interest to ALife and evolutionary computation. Strengths include multi-seed ablations (with/without tasks; LDIR blocked), Wilson-interval robustness assays with corrected Z-tests, metabolic-penalty Spearman sweeps, CNP-rate and single-task/smooth-fitness controls, and explicit acknowledgment that programs start with a fixed Z80 ISA. The experimental design is reproducible in outline and the central claims are falsifiable within the stated substrate.

major comments (2)
  1. [Methods §4.5 / Fig. 2F] Methods §4.5 / Fig. 2F: mutational robustness is measured on hand-crafted canonical seeds (LDIR 4-byte prefix + random pad; fixed LDD loop; pure Load-Push repeats), not on the evolved population distribution. The hierarchy LDIR > LDD > Load-Push is therefore a property of these seeds under the interaction register init, not a direct measurement of the lineages that actually take over. Because the paper attributes the Load-Push o LDIR/LDD transition primarily to this robustness hierarchy (with tasks only accelerating it), please either (a) re-run the assay on samples drawn from evolved grids at intermediate epochs, or (b) clearly qualify that the hierarchy is a seed-level proxy and discuss other factors (discovery rate, compatibility with task code, stack/register interference) that could drive takeover.
  2. [§2.5 / Abstract] §2.5, Fig. 4–5, Abstract: the phrase “spontaneous self-replication generates an emergent learning curriculum” risks overstating what is spontaneous. Niche partition, polynomial assignment, and CNP rate π are experimenter-designed; what emerges is the genealogical use of simpler solutions as stepping stones under that structure. The single-task and CNP-rate controls are strong, but the abstract and results framing should distinguish designed spatial structure from the emergent stepping-stone dynamics, and state that the curriculum is contingent on graded task niches plus sparse migration rather than on replication alone.
minor comments (6)
  1. [Methods §4.4] Methods §4.4: byte-substring replicator counts can miss NO-OP-interleaved variants and can double-count tapes carrying multiple patterns. The authors note the sum approximates population size; still, state the false-negative/false-positive risk explicitly in the figure caption or methods and, if feasible, report a short sensitivity check (e.g., allowing one intervening byte).
  2. [Fig. 1E] Fig. 1E colormap and “green bias for validation success” are described only briefly; a short legend or supplementary panel mapping byte patterns to colors would help readers interpret homogenization vs. niche solutions.
  3. [Table 1 / Algorithm 1] Table 1 and Algorithm 1: the realized fraction of programs selected per epoch (~56% after de-duplication) is mentioned in text but not in the parameter table; adding it would aid reimplementation.
  4. [Discussion] Discussion: the predefined-semantics caveat is appropriately noted; consider also flagging that LDIR/LDD are unusually powerful single-instruction block-copy primitives relative to a more minimal ISA, so the compact-replicator attractor may be substrate-specific.
  5. [Author Contributions] Author contributions list “C.K.” who does not appear in the author list; please reconcile.
  6. [Throughout] Minor typography: “immediate no means” (§2.2) → “no immediate means”; consistent hyphenation of “cross-niche” / “Load-Push”; arXiv date line says July 13, 2026 while v1 is 10 Jul 2026—align.

Circularity Check

1 steps flagged

No significant circularity: experimental outcomes are measured, not forced by definition or fit; mild self-citation of the authors' prior soup framework is substrate background only.

specific steps
  1. self citation load bearing [Introduction / §1 and Discussion]
    "we build directly upon the foundational digital primordial soup framework of Agüera y Arcas et al. [2024] to link the spontaneous emergence of reproduction to the evolution of complex algorithmic behaviors. ... (It should be noted, though, that unlike the case with the origins of life on Earth, our programs were initialized with elements that have predefined computational semantics.)"

    The base spontaneous-replication substrate is taken from a prior paper with substantial author overlap. This is ordinary background citation of the experimental platform, not a load-bearing derivation of the co-evolution, architecture-transition, or curriculum results, which are measured de novo; hence only a minor (score-1) flag.

full rationale

This is an empirical ALife simulation paper. Random 32-byte Z80 tapes are mutated and interact under a competence gate (correct polynomial evaluation raises interaction probability from p_base=0.3 to p_succ=1, optionally metabolically discounted); replication is never supplied as a primitive and must arise from executed instructions. All four primary findings (co-emergence, task pressure accelerating compact LDIR/LDD over Load-Push, conditional HALT under metabolic cost, CNP niches yielding an emergent curriculum) are reported as multi-seed population statistics and ablations (Figs. 2–5, Methods §§4.1–4.8). There are no algebraic identities equating outputs to inputs, no parameters fitted to data then re-labeled as predictions, no uniqueness theorems, and no ansatz smuggled via citation. The sole self-citation (Agüera y Arcas et al. 2024, overlapping authors) supplies the unseeded primordial-soup substrate; the co-evolution claims and architectural transitions are new experimental results on that substrate and do not reduce to the citation. The Discussion’s explicit caveat that programs begin with a fixed Z80 ISA of predefined semantics is a modeling limitation, not an internal circularity. Score 1 reflects only the non-load-bearing self-citation of the base framework.

Axiom & Free-Parameter Ledger

7 free parameters · 4 axioms · 2 invented entities

The central claims rest on a constructed digital substrate (Z80 semantics, fixed tape length, competence gate, spatial niches) and several hand-chosen rates. No new physical entities are postulated; 'Load-Push', 'LDIR', and 'LDD' are descriptive labels for observed instruction patterns. Free parameters control selection intensity and migration and therefore shape which architectures win.

free parameters (7)
  • baseline interaction probability p_base
    Hand-set to 0.3; failed programs still interact at this rate, controlling how strongly task success is required for spread.
  • success interaction probability p_succ
    Hand-set to 1.0 for validated programs; defines the strength of competence gating.
  • cross-niche pollination rate π
    Default 0.05; curriculum results depend critically on this rate (Fig. 4A).
  • metabolic penalty coefficient C
    Default 0.3, swept in [0,0.7]; scales interaction probability by execution steps and drives conditional halting.
  • program length ℓ and instruction budget B
    ℓ=32 bytes, B=512 instructions; hard ceilings that force competition between replication and task code.
  • per-program mutation rate
    1/64 chance to reinitialize one random byte per epoch; sets mutational load relative to robustness hierarchy.
  • task-solved threshold
    Niche counted solved when ≥10% of programs correct on all 16 inputs; reporting threshold chosen by authors.
axioms (4)
  • domain assumption Z80 instruction semantics (including LDIR/LDD/PUSH and register initialization) are fixed and available from the start
    Discussion explicitly notes programs begin with predefined computational semantics; emergence is relative to this ISA.
  • ad hoc to paper Pairwise concatenation, fixed-budget execution, and overwrite of both cells is a valid model of interaction/heredity
    Core interaction rule in §2.1 and Algorithm 1; not derived from biology, chosen as the soup substrate.
  • ad hoc to paper Correct polynomial evaluation on three random inputs is a sufficient competence gate without hard-coding replication
    Methods §4.1; decouples fitness from copy while still imposing a fitness landscape.
  • domain assumption Spatial niches with sparse long-range pollination model structured populations that can form curricula
    Invokes Wright/Rainey-style spatial structure; π and niche partition are design choices.
invented entities (2)
  • Competence-gated interaction rule no independent evidence
    purpose: Links task success to interaction opportunity without supplying a copy command
    Central experimental intervention; independent evidence only within this simulation class.
  • Load-Push / LDIR / LDD replicator classes no independent evidence
    purpose: Taxonomy used to track reproductive architecture turnover and robustness hierarchy
    Descriptive patterns discovered by inspection and byte matching; not new physical objects but paper-defined categories that drive the second main finding.

pith-pipeline@v1.1.0-grok45 · 21948 in / 3198 out tokens · 35328 ms · 2026-07-13T04:39:05.001359+00:00 · methodology

0 comments
read the original 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.

Figures

Figures reproduced from arXiv: 2607.09211 by Alessio Basti, Ben Laurie, Blaise Aguera-Arcas, Blake Richards, Ettore Randazzo, Eyvind Niklasson, Francesco Cicala, James Manyika, Mayalen Etcheverry, Rif A. Saurous, Sami Boukortt.

Figure 1
Figure 1. Figure 1: System architecture. (A) The 32 task niches, each a 128 × 128 grid of 32-byte Z80 programs and each assigned a target polynomial f(x). (B) Selected pairs concatenate their tapes, execute from left to right, undergo random byte-flip mutation, and the resulting halves replace the originals. (C) Competence gating: register D is initialized to a sampled input x ∈ {0, . . . , 15}, the program is executed for up… view at source ↗
Figure 2
Figure 2. Figure 2: Emergence of self-replicators and accelerating effect of tasks: (A) Illustration of a Load-Push replicator. (B) Illustration of a LDIR replicator. (C) Illustration of an LDD replicator. (D) Populations of Load-Push and LDIR replicators over time, with and without tasks. Data shown is mean over 100 seeds. Number of tasks solved also shown as mean ± 95% C.I. (E) Populations of Load-Push and LDD replicators o… view at source ↗
Figure 3
Figure 3. Figure 3: Impact of metabolic constraints on program halting behavior: (A) Average number of execution steps of a run as a function of the strength of the metabolic penalty coefficient. Data points show values for individual runs (100 runs for each of the 8 penalty coefficients). Box plots show the median and interquartile range (IQR), with whiskers extending to 1.5 × IQR. The penalty coefficient correlates negative… view at source ↗
Figure 4
Figure 4. Figure 4: Impact of niche dynamics on task success: (A) Percentage of simulations where at least N tasks are solved for different rates of cross-niche pollination (CNP). A CNP rate of 0.05 solved significantly more tasks compared to both the 0.0 and 0.5 rates (Mann-Whitney U test; vs. 0.0: U = 0.5, p < 0.0001; vs. 0.5: U = 6858.0, p < 0.0001; n = 200 per group). (B) Percentage of simulations where at least N tasks a… view at source ↗
Figure 5
Figure 5. Figure 5: Evidence of an emergent curriculum: (A) Genealogy of programs based on most recent ancestors’ niches. Note the non-uniform, non-symmetric genealogy, implying that solutions to certain tasks tend to evolve from existing solutions to specific easier tasks. Red arrows indicate a common genealogical path, used for constructing the ‘optimal’ curriculum. (B) Success rate per task for the full cross-niche pollina… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

51 extracted references · 9 canonical work pages

  1. [1]

    Holland , editor =

    John H. Holland , editor =. Studies of the Spontaneous Emergence of Self-Replicating Systems Using Cellular Automata and Formal Grammars , booktitle =. 1975 , timestamp =

    1975

  2. [2]

    Science , volume=

    Adaptive radiation from resource competition in digital organisms , author=. Science , volume=. 2004 , publisher=

    2004

  3. [3]

    PLoS computational biology , volume=

    Natural selection fails to optimize mutation rates for long-term adaptation on rugged fitness landscapes , author=. PLoS computational biology , volume=. 2008 , publisher=

    2008

  4. [4]

    and Lehman, Joel , title =

    Stanley, Kenneth O. and Lehman, Joel , title =. 2015 , isbn =

    2015

  5. [5]

    Philosophical Transactions of the Royal Society of London , number =

    Horner, William George , title =. Philosophical Transactions of the Royal Society of London , number =. 1819 , month =. doi:10.1098/rstl.1819.0023 , url =

    doi:10.1098/rstl.1819.0023

  6. [6]

    PLOS Computational Biology , volume=

    Self-replicating artificial neural networks give rise to universal evolutionary dynamics , author=. PLOS Computational Biology , volume=. 2024 , publisher=

    2024

  7. [7]

    and Boniface, Adrien and Camprubi, Eloi and Chandru, Kuhan and Erastova, Valentina and Garg, Sriram G

    Preiner, Martina and Asche, Silke and Becker, Sidney and Betts, Holly C. and Boniface, Adrien and Camprubi, Eloi and Chandru, Kuhan and Erastova, Valentina and Garg, Sriram G. and Khawaja, Nozair and Kostyrka, Gladys and Machné, Rainer and Moggioli, Giacomo and Muchowska, Kamila B. and Neukirchen, Sinje and Peter, Benedikt and Pichlhöfer, Edith and Radván...

    2020

  8. [8]

    Origin of life: The RNA world

    Gilbert, Walter. Origin of life: The RNA world. Nature. doi:10.1038/319618a0

    doi:10.1038/319618a0

  9. [9]

    a chtersh \

    W \"a chtersh \"a user, G \"u nter. The Origin of Life and its Methodological Challenge. J. Theor. Biol

  10. [10]

    Systems protobiology: origin of life in lipid catalytic networks

    Lancet, Doron and Zidovetzki, Raphael and Markovitch, Omer. Systems protobiology: origin of life in lipid catalytic networks. J. R. Soc. Interface. doi:10.1098/rsif.2018.0159

    doi:10.1098/rsif.2018.0159 2018

  11. [11]

    1986 , issn =

    Autocatalytic sets of proteins , journal =. 1986 , issn =. doi:https://doi.org/10.1016/S0022-5193(86)80047-9 , url =

    doi:10.1016/s0022-5193(86)80047-9 1986

  12. [12]

    Autocatalytic Networks at the Basis of Life's Origin and Organization

    Hordijk, Wim and Steel, Mike. Autocatalytic Networks at the Basis of Life's Origin and Organization. Life. doi:10.3390/life8040062

    doi:10.3390/life8040062

  13. [13]

    2000 , publisher=

    Investigations , author=. 2000 , publisher=

    2000

  14. [14]

    A strategy for origins of life research

    Scharf, Caleb and Virgo, Nathaniel and Cleaves, II, H James and Aono, Masashi and Aubert-Kato, Nathanael and Aydinoglu, Arsev and Barahona, Ana and Barge, Laura M and Benner, Steven A and Biehl, Martin and Brasser, Ramon and Butch, Christopher J and Chandru, Kuhan and Cronin, Leroy and Danielache, Sebastian and Fischer, Jakob and Hernlund, John and Hut, P...

  15. [15]

    Artificial Life II , year=

    Algorithmic chemistry: A model for functional self-organization , author=. Artificial Life II , year=

  16. [16]

    , title = "

    Hutton, Tim J. , title = ". Artificial Life , volume =. 2002 , month =. doi:10.1162/106454602321202417 , url =

    work page doi:10.1162/106454602321202417 2002

  17. [17]

    Artificial Life , volume =

    Kruszewski, Germán and Mikolov, Tomáš , title = ". Artificial Life , volume =. 2022 , month =. doi:10.1162/artl_a_00355 , url =

    doi:10.1162/artl_a_00355 2022

  18. [18]

    Nowak and Hisashi Ohtsuki , title =

    Martin A. Nowak and Hisashi Ohtsuki , title =. Proceedings of the National Academy of Sciences , volume =. 2008 , doi =

    2008

  19. [19]

    The synthesis of a self-propagating and infectious nucleic acid with a purified enzyme

    Spiegelman, S and Haruna, I and Holland, I B and Beaudreau, G and Mills, D. The synthesis of a self-propagating and infectious nucleic acid with a purified enzyme. Proc. Natl. Acad. Sci. U. S. A. doi:10.1073/pnas.54.3.919

    work page doi:10.1073/pnas.54.3.919

  20. [20]

    , title =

    Neumann, John Von and Burks, Arthur W. , title =. 1966 , publisher =

    1966

  21. [21]

    1984 , issn =

    Self-reproduction in cellular automata , journal =. 1984 , issn =. doi:https://doi.org/10.1016/0167-2789(84)90256-2 , url =

    work page doi:10.1016/0167-2789(84)90256-2 1984

  22. [22]

    Toward the Realization of an Evolving Ecosystem on Cellular Automata

    Sayama, Hiroki. Toward the Realization of an Evolving Ecosystem on Cellular Automata

  23. [23]

    , booktitle=

    Oros, Nicolas and Nehaniv, Chrystopher L. , booktitle=. Sexyloop: Self-Reproduction, Evolution and Sex in Cellular Automata , year=

  24. [24]

    How a life-like system emerges from a simple particle motion law

    Schmickl, Thomas and Stefanec, Martin and Crailsheim, Karl. How a life-like system emerges from a simple particle motion law. Sci. Rep. doi:10.1038/srep37969

    work page doi:10.1038/srep37969

  25. [25]

    2024 , eprint=

    Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction , author=. 2024 , eprint=

    2024

  26. [26]

    Distill , year =

    Mordvintsev, Alexander and Randazzo, Ettore and Niklasson, Eyvind and Levin, Michael , title =. Distill , year =

  27. [27]

    Qeios , year=

    Sinapayen, Lana , title=. Qeios , year=. doi:10.32388/JPUWVB , url=

    work page doi:10.32388/jpuwvb

  28. [28]

    2018 , eprint=

    Neural Network Quine , author=. 2018 , eprint=

    2018

  29. [29]

    2021 , month =

    Randazzo, Ettore and Versari, Luca and Mordvintsev, Alexander , title = ". 2021 , month =. doi:10.1162/isal_a_00367 , url =

    work page doi:10.1162/isal_a_00367 2021

  30. [30]

    2023 , eprint=

    Biomaker CA: a Biome Maker project using Cellular Automata , author=. 2023 , eprint=

    2023

  31. [31]

    2024 , eprint=

    JaxLife: An Open-Ended Agentic Simulator , author=. 2024 , eprint=

    2024

  32. [32]

    , year =

    Ofria, Charles and Wilke, Claus O. , year =. Avida: A Software Platform for Research in Computational Evolutionary Biology , volume =. Artificial Life , publisher =. doi:10.1162/106454604773563612 , number =

    work page doi:10.1162/106454604773563612

  33. [33]

    Acosta and Luis Zaman , title =

    Bhaskar Kumawat and Alexander Lalejini and Monica M. Acosta and Luis Zaman , title =. Proceedings of the National Academy of Sciences , volume =. 2025 , doi =. https://www.pnas.org/doi/pdf/10.1073/pnas.2413930121 , abstract =

    doi:10.1073/pnas.2413930121 2025

  34. [34]

    Scientific Excellence in Supercomputing

    Evolution and optimization of digital organisms. Scientific Excellence in Supercomputing. 1991

    1991

  35. [35]

    Physica D: Nonlinear Phenomena , volume=

    Evolution, complexity, entropy and artificial reality , author=. Physica D: Nonlinear Phenomena , volume=. 1994 , publisher=

    1994

  36. [36]

    The coreworld: Emergence and evolution of cooperative structures in a computational chemistry , journal =

    Steen Rasmussen and Carsten Knudsen and Rasmus Feldberg and Morten Hindsholm , abstract =. The coreworld: Emergence and evolution of cooperative structures in a computational chemistry , journal =. 1990 , issn =. doi:https://doi.org/10.1016/0167-2789(90)90070-6 , url =

    work page doi:10.1016/0167-2789(90)90070-6 1990

  37. [37]

    Eiben, A. E. and Smith, J. E. , title =

  38. [38]

    Knudsen and Rasmus Feldberg

    Steen Rasmussen and C. Knudsen and Rasmus Feldberg. Dynamics of Programmable Matter. Proceedings of the Second Artificial Life Workshop. 1991

    1991

  39. [39]

    Pargellis , abstract =

    A.N. Pargellis , abstract =. The evolution of self-replicating computer organisms , journal =. 1996 , issn =. doi:https://doi.org/10.1016/0167-2789(96)00089-9 , url =

    work page doi:10.1016/0167-2789(96)00089-9 1996

  40. [40]

    and Ofria, Charles and Pennock, Robert T

    Lenski, Richard E. and Ofria, Charles and Pennock, Robert T. and Adami, Christoph , year =. The evolutionary origin of complex features , volume =. Nature , publisher =. doi:10.1038/nature01568 , number =

    doi:10.1038/nature01568

  41. [41]

    , title =

    Goldberg, David E. , title =. 1989 , isbn =

    1989

  42. [42]

    Journal of Molecular Evolution , volume=

    An origin-of-life reactor to simulate alkaline hydrothermal vents , author=. Journal of Molecular Evolution , volume=. 2014 , doi=

    2014

  43. [43]

    2003 , publisher=

    The principles of life , author=. 2003 , publisher=

    2003

  44. [44]

    1999 , publisher=

    Origins of life , author=. 1999 , publisher=

    1999

  45. [45]

    1998 , publisher=

    Introduction to Artificial Life , author=. 1998 , publisher=

    1998

  46. [46]

    Origins of Life and Evolution of the Biosphere , volume=

    A universal definition of life: autonomy and open-ended evolution , author=. Origins of Life and Evolution of the Biosphere , volume=. 2004 , publisher=

    2004

  47. [47]

    Journal of Theoretical Biology , volume=

    Towards a general theory of adaptive walks on rugged landscapes , author=. Journal of Theoretical Biology , volume=. 1987 , publisher=

    1987

  48. [48]

    Frontiers in Microbiology , volume=

    Drivers of bacterial maintenance and minimal energy requirements , author=. Frontiers in Microbiology , volume=. 2017 , publisher=

    2017

  49. [49]

    Proceedings of the Sixth International Congress of Genetics , volume=

    The roles of mutation, inbreeding, crossbreeding, and selection in evolution , author=. Proceedings of the Sixth International Congress of Genetics , volume=

  50. [50]

    Nature , volume=

    Adaptive radiation in a heterogeneous environment , author=. Nature , volume=. 1998 , publisher=

    1998

  51. [51]

    Evolutionary Computation , volume=

    Abandoning objectives: Evolution through the search for novelty alone , author=. Evolutionary Computation , volume=. 2011 , publisher=

    2011