Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7:225-275, 2001 Summarized by In-Hee Lee.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Agent-based Modeling: A Brief Introduction Louis J. Gross The Institute for Environmental Modeling Departments of Ecology and Evolutionary Biology and.
Transfer FAS UAS SAINT-PETERSBURG STATE UNIVERSITY COMPUTATIONAL PHYSICS Introduction Physical basis Molecular dynamics Temperature and thermostat Numerical.
UNIT-III By Mr. M. V. Nikum (B.E.I.T). Programming Language Lexical and Syntactic features of a programming Language are specified by its grammar Language:-
Mining Graphs.
An Introduction to Modeling Instruction Mark Schober Columbia Secondary School, New York City Jeff Saul University of New Mexico, Albuquerque.
Intelligence without Reason
Chemical Computing Peter Dittrich Bio Systems Analysis Department. of Mathematics and Computer Science Friedrich-Schiller-University Jena Friedrich-Schiller-Universität.
1 Lecture-2 CS-120 Fall 2000 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.
Outline Chapter 1 Hardware, Software, Programming, Web surfing, … Chapter Goals –Describe the layers of a computer system –Describe the concept.
Finite Automata Chapter 5. Formal Language Definitions Why need formal definitions of language –Define a precise, unambiguous and uniform interpretation.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
제 11 주. 응용 -5: Economics Agent-based Computational Economics: Growing Economies from the Bottom Up L. Tesfatsion, Artificial Life, vol. 8, no. 1, pp. 55~82,
THE ICT WAY.  ABSTRACT – Chemistry in many of it areas becomes quite very abstract for learner to grasp and understand thus very challenging for a teacher.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Artificial Chemistries Autonomic Computer Systems University of Basel Yvonne Mathis.
Invitation to Computer Science 5th Edition
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
COMPUTER ORGANIZATIONS CSNB123 May 2014Systems and Networking1.
Irreducibility and Unpredictability in Nature Computer Science Department SJSU CS240 Harry Fu.
Governor’s School for the Sciences Mathematics Day 13.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
CS/IT 138 THEORY OF COMPUTATION Chapter 1 Introduction to the Theory of Computation.
Introduction to Theory of Automata
Welcome to AP Biology Mr. Levine Ext. # 2317.
A new Programming Paradigm inspired by Algorithmic Chemistries UPP 2004 September 2004 Wolfgang Banzhaf, Memorial University of Newfoundland, Canada and.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
Simulating Human Agropastoral Activities Using Hybrid Agent- Landscape Modeling M. Barton School of Human Evolution and Social Change College of Liberal.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Introduction to Self-Organization
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Machine Learning: Social and Emergent Luger: Artificial.
“Politehnica” University of Timisoara Course No. 2: Static and Dynamic Configurable Systems (paper by Sanchez, Sipper, Haenni, Beuchat, Stauffer, Uribe)
An Introduction to the Cycles of Modeling Mark Schober John Burroughs School, St. Louis, Mo. Hilary Haugen California High School, San Ramon Matt Greenwolfe.
STATISTICAL COMPLEXITY ANALYSIS Dr. Dmitry Nerukh Giorgos Karvounis.
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Theory of Programming Languages Introduction. What is a Programming Language? John von Neumann (1940’s) –Stored program concept –CPU actions determined.
CS 478 – Tools for Machine Learning and Data Mining Perceptron.
COMPUTER ORGANIZATIONS CSNB123 NSMS2013 Ver.1Systems and Networking1.
Computational Tools for Population Biology Tanya Berger-Wolf, Computer Science, UIC; Daniel Rubenstein, Ecology and Evolutionary Biology, Princeton; Jared.
Cellular Automata FRES 1010 Eileen Kraemer Fall 2005.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
Cellular Automata BIOL/CMSC 361: Emergence 2/12/08.
Chapter 1: Introduction to Neuro-Fuzzy (NF) and Soft Computing (SC)
Computational Mechanics of ECAs, and Machine Metrics.
Using Lateral Capillary Forces to Compute by Self-assembly Paul W. K. Rothemund PNAS, Feb. 1, 2000, vol. 97, no. 3, pp Summarized by Lee, In-Hee.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Bits don’t have error bars Russ Abbott Department of Computer Science California State University, Los Angeles.
Bits don’t have error bars Russ Abbott Department of Computer Science California State University, Los Angeles.
CS223: Software Engineering
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
Organic Evolution and Problem Solving Je-Gun Joung.
Computing Systems Lecture 12 Future Computing. Natural computing Take inspiration from nature for the development of novel problem-solving techniques.
Theory of Computation Automata Theory Dr. Ayman Srour.
Application of a CA Model to Simulate the Impacts of Road Infrastructures on Urban Growth Nuno Pinto and António Antunes, University of Coimbra with Josep.
Artificial Intelligence DNA Hypernetworks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Topic 3: Automata Theory 1. OutlineOutline Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.
Chapter 14. Conclusions From “The Computational Nature of Language Learning and Evolution” Summarized by Seok Ho-Sik.
CSE202: Introduction to Formal Languages and Automata Theory
Fall 2004 Perceptron CS478 - Machine Learning.
Evolutionary Algorithms
فصل سوم The Church-Turing Thesis
Horn Clause Computation by Self-Assembly of DNA Molecules
CSE S. Tanimoto Turing Completeness
Presentation transcript:

Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7: , 2001 Summarized by In-Hee Lee

© 2002, SNU BioIntelligence Lab, Contents 1. Artificial life and artificial chemistry 2. Basic concepts 3. Approaches 4. Applications 5. Common phenomena 6. Discussion and outlook

© 2002, SNU BioIntelligence Lab, 1. Artificial Life and Artificial Chemistry Artificial Life  Abstracts from specific examples of real living processes and tries to integrate different approaches into one interdisplinary attempt to extract the first principles of life. Artificial Chemistry  By abstracting from natural molecular processes, tries to investigate the dynamics of these complex systems.

© 2002, SNU BioIntelligence Lab, 2. Basic Concepts Artificial Chemistry  Man-made system that is similar to a real chemical system.  Defined by a triple (S, R, A).  Set of molecules S  Set of rules R  Reactor algorithm A – dynamics  S: all valid molecules that may appear in an AC.  R: interactions between molecules in S.  A: determines how R is applied to a collection of molecules.

© 2002, SNU BioIntelligence Lab, Two Examples (1/2) Non-constructive explicit chemistry  Molecules:  Reactions:

© 2002, SNU BioIntelligence Lab, Two Examples (2/2) Constructive implicit chemistry  Molecules:  Reactions:

© 2002, SNU BioIntelligence Lab, Characteristics and Methods (1/2) 1. Definition of molecules  Explicit: enumeration of symbols.  Implicit: description of how to construct a molecule. 2. Definition of reaction laws  Explicit: interaction between molecules is independent of the molecule structure.  Implicit: interaction must refer to their structures. 3. Definition of dynamics  Explicit: series of formally defined interactions  Implicit: dynamics is caused by the synchronous or asynchronous update of interactions

© 2002, SNU BioIntelligence Lab, Characteristics and Methods (2/2) 4. Levels of abstraction  Analogous: an isomorphism between a molecule or action in AC to a molecule or action in chemistry exists  Abstract: such isomorphism doesn’t exist. 5. Constructive dynamical systems  New components can appear. 6. Random chemistries 7. Measuring time 8. Pattern matching 9. Spatial topology

© 2002, SNU BioIntelligence Lab, 3. Approaches (1/6) Rewriting or production systems  Consists of certain entities or symbols and a set of rules for performing replacements.  Rule defines whether a pattern of symbols can be replaced by other pattern.  Examples  The chemical abstract machine (CHAM)  The chemical rewriting system on multisets (ARMS)  The chemical casting model (CCM)  Lambda-calculus (AlChemy)

© 2002, SNU BioIntelligence Lab, 3. Approaches (2/6) Arithmetic operations  Representations and operators can be borrowed from mathematics to construct AC.  Examples  Simple arithmetic operations  Matrix-multiplication chemistry Autocatalytic polymer chemistries  Molecules: character sequences  Reactions: concatenation and cleavage.

© 2002, SNU BioIntelligence Lab, 3. Approaches (3/6) Abstract automata  Represent molecules as collections of bits organized as binary strings  Molecules appear in two forms: passive data (binary string), active machine. Artificial molecular machines  Molecules: strings of symbols (data or machine)  Reactions: two molecules binds at a site and executes instructions at the site.  Examples  Polymers as Turing machines  Machine-tape interaction  Automata reaction

© 2002, SNU BioIntelligence Lab, 3. Approaches (4/6) Assembler automata  Parallel computation machine that consists of a core memory and parallel processing units.  Programs struggle for computer resources and may fight each other.  Examples  Coreworld  Tierra  Avida

© 2002, SNU BioIntelligence Lab, 3. Approaches (5/6) Lattice molecular systems  Consists of a regular lattice.  Each lattice can hold a part of a molecule.  Bonds can be formed between parts.  Examples  Autopoietic system  Lattice polymers  Lattice molecular automaton  Self-replicating cell

© 2002, SNU BioIntelligence Lab, 3. Approaches (6/6) Other approaches  Mechanical artificial chemistry  Basic units are regular triangular units, which may form bonds by magnets.  The chemical metaphor in cellular automata (CA)  Self-replicating loops  Embedded particles in CA as molecules  Typogenetics

© 2002, SNU BioIntelligence Lab, 4. Applications (1/2) Modeling, information processing, and optimization. Modeling  Biochemical systems are mainly modeled.  Population dynamics, ecological systems, social systems, or economic markets. Information processing  Data can be seen as molecules carrying ‘meaning’.  Processing of data can be regarded as molecule interactions.  Real or artificial chemical computing

© 2002, SNU BioIntelligence Lab, 4. Applications (2/2) Optimization  Use the ability of AC to create evolutionary behavior (or self-evolution)  Use AC for evolutionary optimization.

© 2002, SNU BioIntelligence Lab, 5. Common Phenomena (1/3) Reduction of diversity  Single self-replicating molecule dominates.  Inert population in which no reaction takes place.  Simple network of a few interacting molecules.

© 2002, SNU BioIntelligence Lab, 5. Common Phenomena (2/3)

© 2002, SNU BioIntelligence Lab, 5. Common Phenomena (3/3) Formation of densely coupled stable networks Syntactic and semantic closure  Molecules in stable networks show similarities in structure and function. Evolution and punctuated equilibrium

© 2002, SNU BioIntelligence Lab, 6. Discussion and Outlook The knowledge accumulated in studying AC will provide a fertile ground for new ideas about the origin of life. Important questions  What level of abstraction for an AC is appropriate?  Which key ingredients are missing in current AC?  Do we have to incorporate detailed physical / chemical knowledge?  Is an AC able to create information?