Experiments with a Turing gas: Mimicking chemical evolution*

Similar documents
Complex Systems Theory and Evolution

Catalytic Networks. Mark Baumback

Hierarchical Self-Organization in the Finitary Process Soup

Blank for whiteboard 1

Evolutionary Games and Computer Simulations

Evolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra

FINAL VERSION_ Secondary Preservice Teacher Standards -- Life Science AFK12SE/NGSS Strand Disciplinary Core Idea

arxiv: v1 [q-bio.pe] 28 Apr 2007

Mechanisms of Emergent Computation in Cellular Automata

Catalytic Search in Dynamic Environments

RNA evolution and Genotype to Phenotype maps

Lecture 9 Evolutionary Computation: Genetic algorithms

Haploid-Diploid Algorithms

Enduring understanding 1.A: Change in the genetic makeup of a population over time is evolution.

Autocatalytic Sets and the Growth of Complexity in an. Evolutionary Model. Abstract

Cellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.

Big Idea 1: The process of evolution drives the diversity and unity of life.

AP Curriculum Framework with Learning Objectives

A different perspective. Genes, bioinformatics and dynamics. Metaphysics of science. The gene. Peter R Wills

Risk of extinction and bottleneck effect in Penna model

Major questions of evolutionary genetics. Experimental tools of evolutionary genetics. Theoretical population genetics.

biologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

arxiv:physics/ v1 [physics.bio-ph] 30 Sep 2002

Automata-based Verification - III

Evolution of Autocatalytic Sets in Computational Models of Chemical Reaction Networks

CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits

Evaluate evidence provided by data from many scientific disciplines to support biological evolution. [LO 1.9, SP 5.3]

Automata-based Verification - III

Chapter 6- An Introduction to Metabolism*

CSC 4510 Machine Learning

A SYSTEM VIEW TO URBAN PLANNING: AN INTRODUCTION

Normalised evolutionary activity statistics and the need for phenotypic evidence

II. Spatial Systems. A. Cellular Automata. Structure. Cellular Automata (CAs) Example: Conway s Game of Life. State Transition Rule

Shannon Information (very briefly!) Lecture 4. Maximum and Minimum Entropy. Entropy. Entropy of Transition Rules. Entropy Examples

1 Two-Way Deterministic Finite Automata

BIOLOGICAL SCIENCE. Lecture Presentation by Cindy S. Malone, PhD, California State University Northridge. FIFTH EDITION Freeman Quillin Allison

Decision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012

SUPPLEMENTARY INFORMATION

biologically-inspired computing lecture 5 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY

How to Program Artificial Chemistries

ECE260: Fundamentals of Computer Engineering

The lecture notes and homework will be posted on the Web

An ant colony algorithm for multiple sequence alignment in bioinformatics

Lectures on Medical Biophysics Department of Biophysics, Medical Faculty, Masaryk University in Brno. Biocybernetics

1.5 Sequence alignment

Chemical Reac+ons and Enzymes. Lesson Overview. Lesson Overview. 2.4 Chemical Reactions and Enzymes

Episode 535: Particle reactions

Turing Machines. Lecture 8

98 Washington State K-12 Science Learning Standards Version 1.2

Turing Machines, diagonalization, the halting problem, reducibility

Haploid & diploid recombination and their evolutionary impact

Cryptographic Hash Functions

A A A A B B1

Non-independence in Statistical Tests for Discrete Cross-species Data

New Minimal Weight Representations for Left-to-Right Window Methods

Turing Machines Part II

MATH1013 Calculus I. Limits (part I) 1

Spatio-Temporal Relationships in a Primitive Space: an attempt to simplify spatio-temporal analysis

K. Viray APES Ch 1 & 2 Unit 1: Introduction to Environmental Science & Systems. Chapter 1 Vocabulary List

SPA for quantitative analysis: Lecture 6 Modelling Biological Processes

Crossover Techniques in GAs

Turing Machines Part II

Structure Design of Neural Networks Using Genetic Algorithms

NP, polynomial-time mapping reductions, and NP-completeness

An Introduction to Metabolism

Complex Systems Theory

Construction of universal one-way hash functions: Tree hashing revisited

CHAPTER 12 Boolean Algebra

II. Spatial Systems A. Cellular Automata 8/24/08 1

Bis2A: 2.3 Interpreting Chemical Reactions

14.1 Expressing the Reaction Rate

Molecular evolution - Part 1. Pawan Dhar BII

With high probability

Thermodynamics of computation.

Module 03 Lecture 14 Inferential Statistics ANOVA and TOI

Development. biologically-inspired computing. lecture 16. Informatics luis rocha x x x. Syntactic Operations. biologically Inspired computing

Enzyme Enzymes are proteins that act as biological catalysts. Enzymes accelerate, or catalyze, chemical reactions. The molecules at the beginning of

Self-Programming of Matter and the Evolution of Proto-Biological Organizations

The Passport Control Problem or How to Keep an Unstable Service System Load Balanced?

56:198:582 Biological Networks Lecture 9

Expected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions

CHEMICAL KINETICS. Collision theory and concepts, activation energy and its importance VERY SHORT ANSWER QUESTIONS

A An Overview of Complexity Theory for the Algorithm Designer

The Origin Of Life: A Network Oriented View

Languages, regular languages, finite automata

CLOSURE IN ARTIFICIAL CELL SIGNALLING NETWORKS Investigating the Emergence of Cognition in Collectively Autocatalytic Reaction Networks

Computational statistics

IV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University

On the Effectiveness of Symmetry Breaking

Boolean circuits. Lecture Definitions

Structures and Functions of Living Organisms (LS1)

ACTA PHYSICA DEBRECINA XLVI, 47 (2012) MODELLING GENE REGULATION WITH BOOLEAN NETWORKS. Abstract

Players as Serial or Parallel Random Access Machines. Timothy Van Zandt. INSEAD (France)

Map of AP-Aligned Bio-Rad Kits with Learning Objectives

Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions

Search. Search is a key component of intelligent problem solving. Get closer to the goal if time is not enough

Rhythms Emerge in a Collection of `Blind' Chemicals by the Use of `Genetic Switches'

The Origin of Life on Earth

MITOCW enzyme_kinetics

Comprehensive support for quantitation

Transcription:

Experiments with a Turing gas: Mimicking chemical evolution* RENUKA RAI and HARJINDER SINGH* Department of Chemistry, Panjab University, Chandigarh 1614, India *Corresponding author (Fax, 91-172-54149; Email, raman%phys@ puniv.chd.nic.in ). Three different experiments with colliding artificial molecules, made of binary strings, are reported. Rules of evolution are designed such that the innovative collisions, i.e., those producing new species at the end of a reaction, become a negligible part of total number of collisions after a sufficiently large number of collisions have taken place. The distribution of species in the final mixture according to their bit size as well as the decay profile of the reactive and the innovative collisions are obtained. It is seen that the prescribed rules are sufficient to characterize a self-regulatory feature of the evolving system. 1. Introduction The study of evolving systems is a major part of complex systems research. In its widest sense, evolution is just another word for a change in time. We witi, however, consider evolving systems as those that move towards a greater extent of self-organization and complexity as time flows. Such systems are abundant in nature, from the world of molecules to that of organisms. Man-made evolving systems share numerous features with natural systems. Therefore, similar theoretical methods have been used to study organismal evolution, evolution of proteins from small molecules, economic systems, urbanization and many other problems. Experimental studies of dynamical behaviour at diverse scales of biological organization are difficult because of limited techniques and objects available for experimentation and severe constraints of time and space. Moreover, realistic description of such systems is often next to impossible. An alternative approach to studying evolving systems is to create and study artificial entities that mimic natural evolution (Artificial Life 1989, 1992, 1994). In physical and chemical systems a wide spectrum of interactions between atoms and molecules producing new atoms and molecules exists. Molecules are arrangements of atoms in a specific way according to their chemical properties. They have the ability to interact with other atoms and molecules to create new molecules. This is analogous to the manner in which the individual corn- ponents in any other evolving system, biological or otherwise, show a tendency toward self-organization. We present here a pedagogical exercise in exploring adaptive behaviour in a simple computer model involving strings of bits. The model utilizes an important characteristic of an adaptive system; namely, the objects of which it is made interact with the objects of the system themselves and a self-referential loop of object-function properties is formed. We try to isolate simple features of this model, such as self-regulatory growth, and limit ourselves to elucidating the rules leading to these properties. 2. The Turing gas Evolving systems frequently show a tendency to organize themselves. The order that emerges in a system may be a consequence of different factors. Most generally, a Darwinian model is utilized, where populations of organisms are randomly varying systems shaped to adaptation by external forces by the process of natural selection. In the process of molecular evolution, all this information is contained in the expressions for the rate processes involving reactivity as well as other terms contributing to spatio-temporal changes. For instance, consider the building of large molecules, P (say, a polymer) from smaller units, M (say, a monomer). The polymerization process, leading potentially to the formation of various types of polymers, itself is an evolution *Presented at the National Symposium on Evolution of Life. Keywords. Artificial molecules; binary strings; Turing gas: chemical evolution J. Biosci., 23, No. I. March 1998, pp 37--41. 9 Indian Academy of Sciences 37

38 Renuka Rai and Harjinder Singh in time. Simultaneously, random mutations may be occurring. Thus, there is a competition between species that is expressed by means of non-linear kinetics. Solution of the resulting non-linear differential equations provides varying concentration (population) profiles of the different species. In nature, however, species are typically numerous. Thus, what one has is a larger set of coupled non-linear differential equations, the solution of which is enormously computer-intensive. Instead of the differential equation approach, networks of artificial 'logical' reactions can be used as alternative models of interactive processes in nature (Kauffman 1993). A specific collection of polymers, which are in fact interacting strings of characters in a language, autocatalytic in their reactive behaviour, describe the evolving set at a point of time. Such a set, called a Turing gas, itself evolves out of a simple, undifferentiated initial state, generating a sequence of highly differentiated final states. In such abstract artificial chemistries, the goal is not to achieve a precise reproduction of the path from the pre-biotic soup to the modern day Homo sapiens; rather it is to seek a better theoretical insight into how complexity and, perhaps, life emerges within a wide class of pre-biotic soups. Artificial chemistry models of evolving systems have been used by a number of people. Fontana (1992, 1994), for instance, has used functions expressed in a symbol manipulation system called A-calculus, represented as strings of characters and reacting with similar functional strings via function composition, producing new strings in the process. The ability to utilize functional programming provides in turn an enhanced ability to search for combinatorial loops in evolution. We describe below three experiments done with a Turing gas using a common procedural programming language. As mentioned earlier, this is a pedagogical exercise and hence, some of the intricate features mentioned above are not investigated. Rather, using a procedural language we wish to make the point that even with poor computational facility, such experiments can be carried out and meaningful conclusions can be reached. 3. Three experiments with evolving molecules We have used a procedural programming language, C, to build a model tor representation and isolation of a few features of adaptive systems. In our model, the combinatorial objects are represented by strings of characters ('' and '1'). Three different sets of rules are designed that transtorm the strings into other strings. In all the three experiments, strings consisting of '' and 'l' are generated randomly. Once generated, the strings are allowed to interact and the expression for their interaction is evaluated. The rules of interaction for the three experiments are given in table I. In some of the interactions, the least significant bit(s) [LSB, the bit(s) with the least place value(s)] of the first string and/or the most significant bit (MSB, the bit with the highest place value) of the second string are involved, such that a product different from the original reactants is produced. These are the reactive collisions. In another kind of reactive collisions, a string that is not new but a copy of one of the reactants is produced or a reactant simply disappears. Every other collision, when nothing else happens other than the original reactants remaining unchanged, is termed non-reactive or elastic. After each reactive collision, the system is scanned to check if the product string is already present in the set. A collision that leads to the formation of a string that was not present earlier in the set is termed innovative. The rules are to a large extent arbitrary. However, what we present here are three select set of rules amongst many we used, with an objective of restricting innovative collisions between strings so that limit to growth may become possible. We impose the general restriction that strings with more than 5 bits cannot react. This is a reflection of the steric or other inhibition of functional activity. In natural systems, this could correspond, for instance, to the trapping of the functionally active parts of the system in inert areas created by a size above a threshold or to a catastrophe that has a terminal impact only on the larger strings. Such a restriction has been used in earlier studies also (Kauffman 1993). Experiment I: A set of 1 strings is generated randomly. Out of this set two strings are selected at random and allowed to react according to rules prescribed in table 1. A new string is generated if the collision is reactive. To keep the number of strings in the set constant, one of the original 1 strings is removed randomly from the set after each reactive collision. Since each string may occur more than once, the probability of selection of strings for collision as well as for removal is proportional to its frequency in the set. Experiment 2: From a set of 15 randomly generated strings, two are selected to collide and the interaction expression is evaluated as prescribed in table 1. In this experiment the colliding strings as well as the string which is produced are preserved. No string is removed from the set. As a result, the number of strings after every reactive collisions increases by one. Experiment 3: A set of 15 strings is generated and from it 2 are picked at random for collision. In this experiment, the rules of interaction are such (table 1) that a reactive collision may lead to generation, modification or deletion of a string. There is no imposed mechanism here to keep the total number of strings constant.

Experiments with a Turing gas: Mimicking chemical evohaion 39 Since the bit structure of each string determines the outcome of its interactions with other strings, there is a built-in structure-function correlation. In this sense, we can use the words 'string' and 'function' interchangeably. 4. Results Experiment 1: The initial set of 1 randomly generated strings are shown in table 2. There are 12 different kind of strings. To investigate how the rules of interaction operate, we allowed for all possible, namely 144, collisions between the pairs of strings. Among these 132 were reactive, of which 48 are innovative. A pair collision analysis reveals that 3 out of 12 functions are general copiers. A general copier is a function that copies every function in the system with which it collides. It is also a self-replicator, i.e., it copies itself. There are 3 selective copiers that copy only particular functions. The other collisions may be either elastic (non-reactive) collisions or a modified string may be generated. Initially the strings consist of two or three bits and the collisions result in strings that max contain higher number of bits. Thus, initially most o~ the collisions are innovative. The rate of innovation is found to decrease as the number of collisions increase, (figure 1). Table 1. Rules of interaction. Experbnent 1: (The reactants are preserved) If the 2 LSB of 1st string are And additionally Result -- Copy the second string 1 If the number of bits in second string is: (i) 2 Copy the second string (ii) clse Append 2nd string to 1st 1 If the 3rd LSB of the 1st string is: (i) Copy the 1st string 11 (ii) 1 Off) Does not exist Experiment 2: (The reactants are preserved) No reaction No reaction Delete the LSB of 1st string and append 2nd string to this LSB of I st MSB of 2nd string string Result 1 1 l I Delete LSB of 1st and MSB of 2nd: then append 2nd to 1st Append 2nd to I st Complement LSB of 1st and MSB of 2nd and append 2nd to I st Delete MSB of 2nd and append it to 1st Experiment 3: LSB of 1st MSB of 2nd string string Result I 1 1 1 Delete LSB of 1st and MSB of 2nd string: append 2nd to I st: replace the 1st string by the new string: store 2nd as such Append 2nd to 1st and replace 2nd string by this: store Ist as such New string generated; complement the LSB of 1st and MSB of 2nd; then append 2rid to 1st Delete MSB of the 2nd and append it to 1st remove the colliding strings from the set Strings with more than 5 bits cannot react (for all experiments). LSB, Least significant bit, i.e., the bit with the h)west place value; MSB, most significant bit. i.e., the bit with the highest place value.

4 Renuka Rai and Hatjinder Singh Experiment 2: The initial set of 15 2-bit strings generated randomly is shown in table 2. There are 4 kinds of strings with 16 possible pair collisions. All of the 16 collisions are reactive and 12 of these are innovative. Similar to the first experintent most of the collisions were found to be innovative initially. But as the number of collisions increases, the elastic collisions are overwhelming in number. This is shown in figure 2a. In figure 2b, we show the distribution of the strings according to the number of bits after 5 collisions. Experiment 3: The initial distribution of randomly generated strings is the same as in experiment 2. Now, out Table 2. The initial distribution of strings. String Frequency Exper~zent I: O 98 Ol 124 1 121 11 13 67 1 62 1 49 11 67 lo 64 lol 72 IIO 74 111 72 Experiments 2 and 3: O 4 1 5 1 3 1t 3 of the 16 possible pair-collisions, 8 result in modification of one of the colliding strings. Four of the reactive collisions lead to deletion of a string and a new string is generated (innovative) from the rest of the four collisions. In figure 3a, is seen a decreasing ratio of innovative collisions as the total number of collisions increase, similar to what was observed in the case of the first two experiments. In figure 3b, the distribution of the strings according to the bit size after 1 collisions is shown. Thus the most common observation is that the kind of rules chosen in these experiments lead to a regulation of the growth (in terms of ratio of innovative interactions to the total number of collisions) in the evolving systems. An interesting feature emerging from figures 2a and 3a is that a distinct power-law like behaviour over a range of number of collisions. This is specially true for the third experiment. This needs to be explored further. 1.E.6'.4 ~ 14- (a) "m,,,,,,,,i........ i........ 1 1 1,4 Number of Collisions 12 (b).8.6.4 ~} 1 - e-.- 'B 8o 61 7= 4 2 1 1 1 1 4 Number of Collisions Figure 1. The number of reactive (I) and innovative (---) collisions compared to the total number of collisions in experiment 1. 2 3 4 5 6 7 8 9 Number of bits Figure 2. (a) 3'he number of reaclivc (--) and innovative (- - -) collisions compared to the total number of collisions in experiment 2. (b) The bit size distribution of strings after 5 collisions in experiment 2.

Experiments with a Turing gas." Mimicking chemical evolution 41 C "t" "6 E Z.8.6.4 5 4 ~ 1 1 1 14 1 s t i 3 ~ #t ~ ~ 1 9 r~ r I" 9 s" (b) - ].... I.... i I I I I I.... T T I I I I.... I I I, I I f, I I 2 3 4 5 6 7 8 9 Number of bits Figure 3. (a) -It]e nulnl-~cr of rcactixc (--) and mnovalive (- - -) collisions compared to the total number of collisions in experiment 3, (b) The bit sizc distributions of strings after 1 (--) and 1 (---) collisions in experiment 3. 5. Discussion The present work is based on the observation that a distinguishing feature of adaptive systems consists of a self-referential structure of combinatorial objects and the functions they themselves encode. Our effort has been to develop a pedagogic model with an aim towards modelling self-regulatory growth. The basic principle is to represent such a system using strings of characters. The behaviour of an ensemble of functions has been studied in terms of a set of character strings. These strings are randomly chosen for pairwise collisions. A collision scheme is a set of rules that determines what happens with a newly created string and with the collision partners. We have conducted three experiments with different n interaction rules and collisions schemes. In all the experiments, it was observed that the rate of innovative collisions decreases rapidly. Thus, effectively, a system with a large number of nonreactive strings emerges. With the increase in number of collisions, the ratio of innovative collisions to the total number of collisions encountered is also found to decrease in all the experiments. Thus, after some time, the system displays mostly autocatalytic processes. The new strings produced already have their copies in the set, indicating a steady closure with respect to interactions. It should be noted that after every reactive collision, a string is removed randomly from the original set, thus there always remains a finite probability for innovative collisions. What is the most interesting outcome of such experiments? The central question here is to see if an organization emerges naturally in an evolving system. What we have addressed is a small part of this question, namely the curtailment of growth beyond a certain size. Many of the interacting species or functions utilized here clearly form an auto-catalytic set. In contrast to realistic experiments in a laboratory, considerations like the size of the entire system of species (volume confining the reactants) do not arise here. Otherwise, similar dynamical characteristics and connectivity features may be explored. The size distribution of species obtained by us (figure 2b) is effectively unimodal at one stage of growth (after 5 collisions) for a particular set of rules of evolution (experiment 2) and bimodal at a later stage (after 1 collisions) and a different set of rules (experiment 3; figure 3b). Kauffman (1993) has shown in more extensive studies that the distribution of the number of species generated after a set of interactions depends on the sub-critical or supra-critical values of a parameter related to the number of kinds of species and the maximal size chosen. Further extensive studies requiring much larger system sizes and the number of collisions as well as a rule-space of much greater expanse need to be made to explore the issue of organization in its entirety. References Art(fi'cial Lit# 1989, Artificial Life 11 1992 and Artificial Life 111 1994 Series of proceedings of interdisciplinat 3, workshops on the synthesis and simtdation qf living systems (cds) C G Langton, C Taylor, J D Farmer and S Rasmussen (Sante Fe Institute, Santa Fe, since 1987, Addison Wesley, New York) Fontana W 1992 Algorithmic chemistry; in Artificial Life 11 p 159 Fontana W and Buss L W 1994 Bull. Math. Biol. 56 I Kauffman S A 1993 The orig#zs of order: Sel/'-organization and selection in evolution (New York: Oxford University Press) MS received 28 April 1997: accepted 27 February 1998 Corresponding editors: AMITABH JOSHI and RAGIqAVENDRA GADAGKAR