Transcript
Page 1: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

Soft Computing Lab.Dept. Computer Science

Yonsei Univ. Korea

Self-replication from random parts30 Mar. 2010, Keunhyun Oh

Saul Griffith, Dan Goldwater, and Joseph M. JacobsonMIT Media Lab

1

Nature, vol. 437, pp. 636, 2005.

Page 2: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

ContentsContents

• Overview

• Related works– Key feature of biological replication– Previous studies

• Proposed methods

• Experiments

• Summary and future works

2/15

Page 3: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

The autonomous self-replicationThe autonomous self-replication

• Autonomously self-replication machines– not yet to acquire the sophistication of biological systems, which assemble

structures from disordered building blocks

• The autonomous replication of complex systems from random inputs

– A replication of a reconfigurable string of parts– Randomly positioned input components

• Components– Suitable Miniaturized and mass-produced– Constituting self-fabricating systems whose assembly is brought about by the

parts themselves

3/15

Page 4: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

4/15

Key feature of biological replicationKey feature of biological replication

• Selecting the appropriate building blocks(nucleotides) from parts (ex. DNA)

– Parts• randomly and continuously distributed in its environment

• Correcting errors made during copying

• The efficiency– Enabling biological systems to generate exponential numbers of accurate

copies of themselves as a function of time

• To create these properties– Autonomous acquisition of randomly distributed building blocks– Carrying out error correction during the copying process

Page 5: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

5/15

Previous studiesPrevious studies

• A scheme for the autonomous self-replication– A simple 2-bit mechanical string outlined almost half a century ago

• Using structured inputs has since been achieved

• Including a self-reproducing machine that relies on a well-or-dered supply of its building blocks

Page 6: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

6/15

The complexity of a given structureThe complexity of a given structure

• The bit length describing the configuration of parts – in this case, a 5-bit string

• Ɛ– the error per addition(arising from random input) of each new building block

in the copied string

• (1- Ɛ)n

– The yield for replicating an n-bit string– Exponentially small for complex (large n) systems

(Ɛ = 0.5, n=5; the yield is about 3% in the case described here)

Page 7: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

7/15

Error correctionError correction

• For complex structures to be copied accurately from random in-puts

• A process in which a linear increase in resource leads to an ex-ponential decrease in error rate

• DNA replication– the polymerase enzymes responsible for copying may also check each re-

cruited nucleotide base for correct complementary base-pairing with the DNA template strand

– if the incoming base does not fit, it is removed by the enzyme’s exonuclease domain.

Page 8: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

8/15

To implement error-correcting repli-cation

To implement error-correcting repli-cation• A set of programmable electromechanical components

– Run as a 7-state, finite-state machine– the components can be reversibly latched and unlatched in response to near-

est neighbor communications– These parts interact by floating on a two-dimensional air table on which mo-

tion is random

• Self-replication of this sequence– A result of a random part latching on to the seed string– the part is queried for self-similarity and proper position in the growing repli-

cant– subsequently it is either permanently latched or released according to an

embedded rule

Page 9: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

9/15

Growing MachinesGrowing Machines

• S. Griffith, 2004

Page 10: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

10/15

6-state machine6-state machine

• S. Griffith, 2004

Page 11: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

11/15

Electromechanical unitsElectromechanical units

Page 12: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

12/15

An example of latching each otherAn example of latching each other

Page 13: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

13/15

Self-replication of a 5-bit stringSelf-replication of a 5-bit string

• Figure 1 shows a series of frame shots that start with a single-seed string (coloured in a green, green, yellow, yellow, green se-quence).

Page 14: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

14/15

ResultResult

• The kinetics of these processes are exponential until they be-come limited by the supply of parts(Fig. 2).

Page 15: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

15/15

Another formationAnother formation

Page 16: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

16/15

Summary and future worksSummary and future works

• Summary– The autonomous replication of complex systems the ability of the DNA tem-

plate to select the right building blocks • A set of randomly scattered parts• The ability to correct copying errors

– developing machines for the autonomous self-replication of a reconfigurable string of parts from randomly positioned components.

• Future works– Machines will be more miniaturized – Possible to create a general system

• self-replicating and programmed to self-fabricate into complex structures that run with exponential kinetics.

Page 17: Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,

Thank you

17


Top Related