Computer Simulations of Evolution Robert C. Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Quick Sort, Shell Sort, Counting Sort, Radix Sort AND Bucket Sort
Best-First Search: Agendas
What are the two most important sentences in ANY piece of writing?
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
21-May-15 Genetic Algorithms. 2 Evolution Here’s a very oversimplified description of how evolution works in biology Organisms (animals or plants) produce.
Maximum Likelihood. Likelihood The likelihood is the probability of the data given the model.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Applications of Evolutionary Computation in the Analysis of Factors Influencing the Evolution of Human Language Alex Decker.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
Genetic Algorithms Learning Machines for knowledge discovery.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Programming.
Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.
The Theory of Evolution by Natural Selection Part 2: Natural Selection.
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
Computability and Modeling Computation What are some really impressive things that computers can do? –Land the space shuttle (and other aircraft) from.
Genetic Algorithm.
Computer Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
An Introduction to Artificial Life Lecture 4b: Informed Search and Exploration Ramin Halavati In which we see how information.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
The Origin of Life Accident or Design? Robert C. Newman.
Genetics Notes Article selections from “Introduction to Genetics” at wikipedia.org.
Evolution Evolution is the change over time in the proportion of individuals in a population differing in one or more inherited traits. Evolution can occur.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Computer Simulations of Evolution Robert C. Newman.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Introduction to History of Life. Biological evolution consists of change in the hereditary characteristics of groups of organisms over the course of generations.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Evolutionary Computation: A New Way to Search for Solutions Blase B. Cindric Mount Union College November 14, 2006.
Local Search and Optimization Presented by Collin Kanaley.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Optimization Problems
Intro to Planning Or, how to represent the planning problem in logic.
How To Program An Overview Or A Reframing of the Question of Programming.
In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.
The Origin of Life Accident or Design? Robert C. Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
WHAT IS A CHATTERBOT? A chatterbot is a computer program that simulates a conversation between two people. That is, one person writes something and the.
Introduction to Genetic Algorithms
Chapter 14 Genetic Algorithms.
Evolution strategies and genetic programming
School of Computer Science & Engineering
What we’ve learned so far…
Advanced Artificial Intelligence Evolutionary Search Algorithm
Theory of Computation Turing Machines.
What are the two most important sentences in ANY piece of writing?
Genetic Algorithms CSCI-2300 Introduction to Algorithms
A Gentle introduction Richard P. Simpson
What is Evolution? The change in DNA of a population over time.
Artificial Intelligence CIS 342
Coevolutionary Automated Software Correction
Presentation transcript:

Computer Simulations of Evolution Robert C. Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

What are we doing here? Not a literature search Not dealing with origin of life Nor with competition & spread of varieties Rather a description & investigation of three programs re/ mechanism of evolution: Two described by Dawkins, Blind Watchmaker BIOMORPH SHAKES One devised by myself MUNSEL Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program BIOMORPH Slightly simplified from Dawkins. Building 'organisms' from genetic information, then selecting among mutants. Gene is a sequence of eight small integers. Integers generate 'tree' by controlling: Branch length Angles Recursion depth (number of levels of branching) Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Sample BIOMORPH Tree Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program BIOMORPH Trees have mirror symmetry. Given a starting gene, program constructs all 'one-step' mutations, displays them on screen. Operator selects which mutant will succeed parent. Program repeats, using chosen mutant. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

BIOMORPH Output Mother surrounded by next generation of mutant daughters Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

BIOMORPH Output Another mother surrounded by next generation of mutant daughters Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Lessons from BIOMORPH Shows how: Mutation operates on DNA Selection operates on developed form, not DNA We see that: Identical forms can conceal different genetics This leaves room for neutral mutation Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKES Give a few monkeys enough time and they will eventually type out the works of Shakespeare. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKES Dawkins in SHAKES seeks to circumvent problem of "monkeys typing Shakespeare" taking an utterly outrageous time to do so. Choose a target sentence or phrase, e.g, "METHINKS IT IS LIKE A WEASEL" Start with gibberish of same length. Mutate gibberish, selecting mutant (if closer to target) as new parent. Repeat with new parent. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKES Gibberish converges to target to reach goal much faster than if monkeys were typing randomly. Dawkins gets convergence in typically generations. Dawkins doesn't describe his program in detail, so can't tell how he generated mutants, nor how many per generation. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Sample from Dawkins (0) Y YVMQKZPFJXWVHGLAWFVCHQXYOPY (10) Y YVMQKSPFTXWSHLIKEFV WQYSPY (20) YETHINKSPITXISHLIKEFA WQYSEY (30) METHINKS IT ISSLIKE A WEFSEY (40) METHINKS IT ISBLIKE A WEASES (50) METHINKS IT ISJLIKE A WEASEO (60) METHNNKS IT IS LIKE A WEASEP (64) METHINKS IT IS LIKE A WEASEL Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKES My version: one mutation each generation, randomly chosen for location & type. This mutant compared with parent. Better of two survives. I get much slower convergence than Dawkins does, typically over 1,000 generations. So Dawkins is doing something much more favorable than this. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKES My version: Target METHINKS IT IS LIKE A WEASEL not reached in 1,000 generations. Target HAPPY BIRTHDAY not reached in 1,000 generations! Target QUO VADIS reached in 867 generations. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Sample from Newman (0) NEOW KERA (50) QVOBUBEGM (100) QVOBUAEGS (200) QUOAUADHS (300) QUO UADHS (400) QUO UADIS (500) QUO UADIS (867) QUO VADIS Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program SHAKEH My version modified: one mutant at each position each generation. This multi-mutant compared with parent. Better of two survives. I now get much faster convergence than before, but still slower than Dawkins does. So Dawkins is doing something still more favorable than this! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Sample from Newman (0) NEOW KERA (20) RSOBVADJQ (30) RSOAVADJS (40) RUOAVADJS (50) RUOAVADIS (60) RUOAVADIS (70) RUOAVADIS (92) QUO VADIS Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Lessons from SHAKES Shows that a 'rachet mechanism' does work. This is an important reason why many are convinced evolution must be correct. But this is guided evolution, i.e., intelligent design! This is a considerably more efficient process even than artificial selection (since it has a target) – to say nothing of natural selection! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Lessons from SHAKES This does not solve the time problem. Which of these versions is most realistic? Mutation rate in eukaryotes is per replication. All these versions ignore time involved for mutant to take over the population. All the versions suggest a problem for mutating into complex or optimal structures: Last pieces of puzzle are highly constrained Therefore very unlikely! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program MUNSEL Simulate mutation and natural selection by analogy with human language. A letter string is both the gene & organism. Mutation is random change in content and/or length. Selection is 'naturalized' by requiring that each grouping in the string be an English word. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

A Sample Run of MUNSEL Start with a single letter: (0) C (4) O (first 1-letter word) (28) LA (first 2-letter word) (43) FAY (first 3-letter word) (54) CARE (first 4-letter word) (61) CARED (first 5-letter word) (382) WOOED (no 6-letter word yet) Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

A Sample Run of MUNSEL Fix length; start with gibberish: (0) MWEOOHA OWM H AOE EKEHT QOEN (11) MWEOOHA CWM Y AFU EO HI QOHN (66) MSEOMD DOWM V ART EI HI QWTB (81) MHEHO DOWM W ART ME HI IWXY (98) MH GO DZWR W ART RE HI ISIY With 98 generations get four words, longest 3 letters. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Program MUNSEL Current version has operator do selecting, but using a spell-checker would be more objective. Program generates words of 1-4 letters rather easily. Relative frequency of space character (and nature of selection) tends to keep words short. Little success in getting intelligibility in 100s of steps. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Lessons from MUNSEL Complex organisms involve hierarchies of structure, somewhat like intelligible writing. Letters > Words > Phrases > Sentences … Mutation only works at lowest level nucleotides  letters So becomes tougher to get anything acceptable as we move up the hierarchy Non-selected mutation  gibberish Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Lessons from MUNSEL Neutral mutations spread only by random walk. Functional isolation seen here Many combinations cannot be reached by single mutations from acceptable smaller groups What is relative size of islands of intelligibility vs oceans of gibberish? Can you really get there from here? Complex organs/organisms Crossing higher levels of biological classification Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Computer Simulations of Evolution? Don't look promising! Suggest some sort of Intelligent design Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org