Evolvable self-replicating molecules in an artificial chemistry

DigiHive: Artificial Chemistry Environment for Modeling of Self-Organization Phenomena

The article presents the DigiHive system, an artificial chemistry simulation environment, and the results of preliminary simulation experiments leading toward building a self-replicating system resembling a living cell. The two-dimensional environment is populated by particles that can bond together and form complexes of particles. Some complexes can recognize and change the structures of surrounding complexes, where the functions they perform are encoded in their structure in the form of Prolog-like language expressions. After introducing the DigiHive environment, we present the results of simulations of two fundamental parts of a self-replicating system, the work of a universal constructor and a copying machine, and the growth and division of a cell-like wall. At the end of the article, the limitations and arising difficulties of modeling in the DigiHive environment are presented, along with a discussion of possible future experiments and applications of this type of modeling.

Emergence of Self-Reproducing Metabolisms as Recursive Algorithms in an Artificial Chemistry

One of the main goals of Artificial Life is to research the conditions for the emergence of life, not necessarily as it is, but as it could be. Artificial chemistries are one of the most important tools for this purpose because they provide us with a basic framework to investigate under which conditions metabolisms capable of reproducing themselves, and ultimately, of evolving, can emerge. While there have been successful attempts at producing examples of emergent self-reproducing metabolisms, the set of rules involved remain too complex to shed much light on the underlying principles at work. In this article, we hypothesize that the key property needed for self-reproducing metabolisms to emerge is the existence of an autocatalyzed subset of Turing-complete reactions. We validate this hypothesis with a minimalistic artificial chemistry with conservation laws, which is based on a Turing-complete rewriting system called combinatory logic. Our experiments show that a single run of this chemistry, starting from a tabula rasa state, discovers-with no external intervention-a wide range of emergent structures including ones that self-reproduce in each cycle. All of these structures take the form of recursive algorithms that acquire basic constituents from the environment and decompose them in a process that is remarkably similar to biological metabolisms.

The automatic parameter-exploration with a machine-learning-like approach: Powering the evolutionary modeling on the origin of life

The origin of life involved complicated evolutionary processes. Computer modeling is a promising way to reveal relevant mechanisms. However, due to the limitation of our knowledge on prebiotic chemistry, it is usually difficult to justify parameter-setting for the modeling. Thus, typically, the studies were conducted in a reverse way: the parameter-space was explored to find those parameter values “supporting” a hypothetical scene (that is, leaving the parameter-justification a later job when sufficient knowledge is available). Exploring the parameter-space manually is an arduous job (especially when the modeling becomes complicated) and additionally, difficult to characterize as regular “Methods” in a paper. Here we show that a machine-learning-like approach may be adopted, automatically optimizing the parameters. With this efficient parameter-exploring approach, the evolutionary modeling on the origin of life would become much more powerful. In particular, based on this, it is expected that more near-reality (complex) models could be introduced, and thereby theoretical research would be more tightly associated with experimental investigation in this field–hopefully leading to significant steps forward in respect to our understanding on the origin of life.

People have long been interested in the evolutionary processes through which life on our planet could have arisen from a non-life background. However, it seems that experimental studies in this field are proceeding slowly, perhaps owing to the complication of such processes. In the meantime, computer modeling has shown its potential to disclose the evolutionary mechanisms involved. Now a major difficulty of the computer modeling work is to justify the parameter-setting–on account of our limited knowledge on prebiotic chemistry and environments. Thus, people tend to explore the parameter space to seek parameter values in favor of the hypothetic scene and leave the parameter-justification a later job when sufficient knowledge is available. To date, the parameter-exploration is usually conducted manually (in many cases by trial and error), thus arduous and unpredictable. Inspired by the algorithm of machine-learning, we designed an automatic approach of parameter-exploration. The results showed that the approach is quite effective–that is, “good” parameter-sets in favor of hypothetic scenes in the origin of life can be found automatically. It is expected that such a machine-learning-like method would greatly enhance the efficiency of our evolutionary modeling studies on the origin of life in future.

How to Build a Biological Machine Using Engineering Materials and Methods

We present work in 3D printing electric motors from basic materials as the key to building a self-replicating machine to colonise the Moon. First, we explore the nature of the biological realm to ascertain its essence, particularly in relation to the origin of life when the inanimate became animate. We take an expansive view of this to ascertain parallels between the biological and the manufactured worlds. Life must have emerged from the available raw material on Earth and, similarly, a self-replicating machine must exploit and leverage the available resources on the Moon. We then examine these lessons to explore the construction of a self-replicating machine using a universal constructor. It is through the universal constructor that the actuator emerges as critical. We propose that 3D printing constitutes an analogue of the biological ribosome and that 3D printing may constitute a universal construction mechanism. Following a description of our progress in 3D printing motors, we suggest that this engineering effort can inform biology, that motors are a key facet of living organisms and illustrate the importance of motors in biology viewed from the perspective of engineering (in the Feynman spirit of “what I cannot create, I cannot understand”).

Origin of life in a digital microcosm

While all organisms on Earth share a common descent, there is no consensus on whether the origin of the ancestral self-replicator was a one-off event or whether it only represented the final survivor of multiple origins. Here, we use the digital evolution system Avida to study the origin of self-replicating computer programs. By using a computational system, we avoid many of the uncertainties inherent in any biochemical system of self-replicators (while running the risk of ignoring a fundamental aspect of biochemistry). We generated the exhaustive set of minimal-genome self-replicators and analysed the network structure of this fitness landscape. We further examined the evolvability of these self-replicators and found that the evolvability of a self-replicator is dependent on its genomic architecture. We also studied the differential ability of replicators to take over the population when competed against each other, akin to a primordial-soup model of biogenesis, and found that the probability of a self-replicator outcompeting the others is not uniform. Instead, progenitor (most-recent common ancestor) genotypes are clustered in a small region of the replicator space. Our results demonstrate how computational systems can be used as test systems for hypotheses concerning the origin of life.This article is part of the themed issue 'Reconceptualizing the origins of life'.

Defining and simulating open-ended novelty: requirements, guidelines, and challenges

The open-endedness of a system is often defined as a continual production of novelty. Here we pin down this concept more fully by defining several types of novelty that a system may exhibit, classified as variation, innovation, and emergence. We then provide a meta-model for including levels of structure in a system's model. From there, we define an architecture suitable for building simulations of open-ended novelty-generating systems and discuss how previously proposed systems fit into this framework. We discuss the design principles applicable to those systems and close with some challenges for the community.

Cell-Division Behavior in a Heterogeneous Swarm Environment

We present a system of virtual particles that interact using simple kinetic rules. It is known that heterogeneous mixtures of particles can produce particularly interesting behaviors. Here we present a two-species three-dimensional swarm in which a behavior emerges that resembles cell division. We show that the dividing behavior exists across a narrow but finite band of parameters and for a wide range of population sizes. When executed in a two-dimensional environment the swarm's characteristics and dynamism manifest differently. In further experiments we show that repeated divisions can occur if the system is extended by a biased equilibrium process to control the split of populations. We propose that this repeated division behavior provides a simple model for cell-division mechanisms and is of interest for the formation of morphological structure and to swarm robotics.

Size selection and adaptive evolution in an artificial chemistry

A simple artificial chemistry for the Squirm3 artificial environment, consisting of replicators that produce quasi-universal enzymes, is presented. The aim of this system is twofold: first, to demonstrate the survival of extracellular replicators despite the presence of faster-replicating parasites; second, to observe the evolution of adaptively useful enzymes. Accomplishing these goals will underpin future attempts to attain open-ended and/or creative evolution in the Squirm3 environment. The first aim is achieved by attaching enzymes to their replicators. Our software implementation demonstrates replicators with 10 bases prospering in the presence of parasites with zero bases. To accomplish the second aim, a process for creating selection pressure toward longer molecules is introduced. The evolution and subsequent dominance of a replicator that produces an adaptively useful enzyme is demonstrated experimentally. Finally, we comment on the crucial role played by neutral evolution and discuss the biological significance of our results.

A self-replicating programmable constructor in a kinematic simulation environment

Cellular automata can model the information processing aspects of a self-replicating programmable constructing system (SRPC), but these models do not contain any notion of material parts and are poor at modelling features of a system that depend upon the motion and connectivity of its components. Physical systems with thousands of parts have the disadvantage that they are time consuming to develop. To overcome these limitations, a simulation environment is presented at a level of abstraction that models motion and connectivity. An SRPC which takes a disorganised collection of parts as its input has been implemented in this environment.

The von Neumann threshold of self-reproducing systems: theory and application

This paper is devoted to the study of systems of entities that are capable of generating other entities of the same kind and, possibly, self-reproducing. The main technical issue addressed is to quantify the requirements that such entities must meet to be able to produce a progeny that is not degenerative, i.e., that has the same reproductive capability as the progenitor. A novel theory that allows an explicit quantification of these requirements is presented. The notion of generation rank of an entity is introduced, and it is proved that the generation process, in most cases, is degenerative in that it strictly and irreversibly decreases the generation rank from parent to descendent. It is also proved that there exists a threshold of rank such that this degeneracy can be avoided if and only if the entity has a generation rank that meets that threshold – this is the von Neumann rank threshold. On the basis of this threshold, an information threshold is derived, which quantifies the minimum amount of information that must be provided to specify an entity such that its descendents are not degenerative. Furthermore, a complexity threshold is obtained, which quantifies the minimum length of the description of that entity in a given language. As an application, self-assembly for a 2 Degrees of Freedom planar robot is considered, and simulation results are presented. A robot arm capable of picking up and placing the components of another arm, in the presence of errors, is considered to have successfully reproduced if these are placed within an allowable tolerance. The example shows that, due to the kinematics of the robot, errors can grow from one generation to the next, until the reproduction process fails eventually. However, error correction (via error sensing and feedback control) can then be used to prevent such degeneracy. The von Neumann generation rank and information thresholds are computed for this example, and are consistent with the simulation results in predicting degeneracy in the case without error correction, and predicting successful self-reproduction in the case with error correction.

Computational discovery of instructionless self-replicating structures in cellular automata

Cellular automata models have historically been a major approach to studying the information-processing properties of self-replication. Here we explore the feasibility of adopting genetic programming so that, when it is given a fairly arbitrary initial cellular automata configuration, it will automatically generate a set of rules that make the given configuration replicate. We found that this approach works surprisingly effectively for structures as large as 50 components or more. The replication mechanisms discovered by genetic programming work quite differently than those of many past manually designed replicators: There is no identifiable instruction sequence or construction arm, the replicating structures generally translate and rotate as they reproduce, and they divide via a fissionlike process that involves highly parallel operations. This makes replication very fast, and one cannot identify which descendant is the parent and which is the child. The ability to automatically generate self-replicating structures in this fashion allowed us to examine the resulting replicators as their properties were systematically varied. Further, it proved possible to produce replicators that simultaneously deposited secondary structures while replicating, as in some past manually designed models. We conclude that genetic programming is a powerful tool for studying self-replication that might also be profitably used in contexts other than cellular spaces.

The organic builder: a public experiment in artificial chemistries and self-replication

We describe some results submitted by users of the Organic Builder, a Java applet where the rules of an artificial chemistry can be chosen in order to achieve a desired behavior. Though it was initially intended as a set of challenges to be tackled as a game, the users experimented with the system far beyond this and discovered several novel forms of self-replicators. When searching for a system with certain properties such asself-replication, making the system accessible to the public through a Web site is an unusual but effective way of making scientific discoveries, credit for which must go to the users themselves for their tireless experimentation and innovation.

Swarm chemistry

We propose swarm chemistry a new artificial chemistry framework that uses artificial swarm populations as chemical reactants. Reaction in swarm chemistry is not determined by predefined reaction rules as commonly assumed in typical artificial chemistry studies, but is spontaneously achieved by the emergence of a new spatiotemporal pattern of collective behavior through the kinetic interaction between multiple chemical species. We developed a prototype of an interactive simulation tool with which one can explore the dynamics of swarm chemistry using an interactive evolutionary method. Several preliminary results are reported to illustrate the characteristics and effectiveness of this framework, including spontaneous segregation of distinct chemical species, production and restriction of movements, and interactive design of complex biological-looking structures.

Ramifying feedback networks, cross-scale interactions, and emergent quasi individuals in Conway's game of Life

Small patterns of state 1 cells on an infinite, otherwise empty array of Conway's game of Life can produce sets of growing structures resembling in significant ways a population of spatially situated individuals in a nonuniform, highly structured environment. Ramifying feedback networks and cross-scale interactions play a central role in the emergence and subsequent dynamics of the quasi population. The implications are discussed: It is proposed that analogous networks and interactions may have been precursors to natural selection in the real world.

Modeling molecular computing systems by an artificial chemistry - its expressive power and application

Artificial chemistries are mainly used to construct virtual systems that are expected to show behavior similar to living systems. In this study, we explore possibilities of applying an artificial chemistry to modeling natural biochemical systems-or, to be specific, molecular computing systems-and show that it may be a useful modeling tool for molecular computation. We previously proposed an artificial chemistry based on string pattern matching and recombination. This article first demonstrates that this artificial chemistry is computationally universal if it has only rules that have one reactant or two reactants. We think this is a good property of an artificial chemistry that models molecular computing, because natural elementary chemical reactions, on which molecular computing is based, are mostly unimolecular or bimolecular. Then we give two illustrative example models for DNA computing in our artificial chemistry: one is for the type of computation called the Adleman-Lipton paradigm, and the other is for a DNA implementation of a finite automaton. Through the construction of these models we observe preferred properties of the artificial chemistry for modeling molecular computing, such as having no spatial structure and being flexible in choosing levels of abstraction.

Evolvable self-reproducing cells in a two-dimensional artificial chemistry

We present a novel unit of evolution: a self-reproducing cell in a two-dimensional artificial chemistry. The cells have a strip of genetic material that is used to produce enzymes, each catalyzing a specific reaction that may affect the survival of the cell. The enzymes are kept inside the cell by a loop of membrane, thus ensuring that only the cell that produced them gets their benefit. A set of reaction rules, each simple and local, allows the cells to copy their genetic information and physically divide. The evolutionary possibilities of the cells are explored, and it is suggested that the system provides a useful framework for testing hypotheses about self-driven evolution.

Mathematical folding of node chains in a molecular network

Under the framework of network artificial chemistry (NAC), a method to construct a phenotypic machine from genotypic information is proposed. The genotype is expressed as a sequence of nodes (a node chain) with symbol data. According to an implemented algorithm, a chain is agglomerated, tangled, and finally folded into a node cluster that works as a control-flow machine in the network. Two examples of control-flow clusters, splitase and replicase, are presented and their functionality is demonstrated. Several meanings and future research directions are discussed.

Self-replication and self-assembly for manufacturing

It has been argued that a central objective of nanotechnology is to make products inexpensively, and that self-replication is an effective approach to very low-cost manufacturing. The research presented here is intended to be a step towards this vision. We describe a computational simulation of nanoscale machines floating in a virtual liquid. The machines can bond together to form strands (chains) that self-replicate and self-assemble into user-specified meshes. There are four types of machines, and the sequence of machine types in a strand determines the shape of the mesh they will build. A strand may be in an unfolded state, in which the bonds are straight, or in a folded state, in which the bond angles depend on the types of machines. By choosing the sequence of machine types in a strand, the user can specify a variety of polygonal shapes. A simulation typically begins with an initial unfolded seed strand in a soup of unbonded machines. The seed strand replicates by bonding with free machines in the soup. The child strands fold into the encoded polygonal shape, and then the polygons drift together and bond to form a mesh. We demonstrate that a variety of polygonal meshes can be manufactured in the simulation, by simply changing the sequence of machine types in the seed.

Evolutionary dynamics of cellular automata-based self-replicators in hostile environments

In this paper we investigate population dynamics, genealogy and complexity-increase of locally interacting populations of cellular automata-based evolving self-replicating loops (evoloops). We outline experiments indicating that the evolutionary growth in complexity, known to be achievable in principle given the complete genetic accessibility granted by universal construction, may be achievable in practice using much simpler replicating structures. By introducing evoloop populations to hostile environments, we demonstrate that selection pressures toward smaller species can be mediated to enable evolutionary accessibility to larger species, which themselves roam a much more vast portion of genetic state-space. We show that this growth in size results from intrinsically biased genealogy inherent in the rules of the evoloop CA, normally suppressed by selection pressures from direct competition favouring the smallest species. This shows that, in populations of simple self-replicating structures, a limited form of complexity-increase may result from a process which is driven by biased genealogical connectivity--a purely emergent property arising out of bottom-up evolutionary dynamics--and not just by adaptation . Implications of this result are discussed and contrasted with other self-replication studies in Artificial Life and Biology.

Self-replicating machines in continuous space with virtual physics

JohnnyVon is an implementation of self-replicating machines in continuous two-dimensional space. Two types of particles drift about in a virtual liquid. The particles are automata with discrete internal states but continuous external relationships. Their internal states are governed by finite state machines, but their external relationships are governed by a simulated physics that includes Brownian motion, viscosity, and springlike attractive and repulsive forces. The particles can be assembled into patterns that can encode arbitrary strings of bits. We demonstrate that, if an arbitrary seed pattern is put in a soup of separate individual particles, the pattern will replicate by assembling the individual particles into copies of itself. We also show that, given sufficient time, a soup of separate individual particles will eventually spontaneously form self-replicating patterns. We discuss the implications of JohnnyVon for research in nanotechnology, theoretical biology, and artificial life.