Computer Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.

Slides:



Advertisements
Similar presentations
Simulation and the Singularity David Chalmers Departments of Philosophy Australian National University New York University.
Advertisements

Turing Machines January 2003 Part 2:. 2 TM Recap We have seen how an abstract TM can be built to implement any computable algorithm TM has components:
Lecture 13 Page 1 CS 111 Online File Systems: Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher.
Suharsh Sivakumar December 11,  A grid of cells where all the cells are governed by a common set of rules based on the number of adjacent neighbors.
G5BAIM Artificial Intelligence Methods
Two-state, Reversible, Universal Cellular Automata In Three Dimensions Authors: Daniel B. Miller & Edward Fredkin Carnegie Mellon West Computing Frontiers.
1 Optimization of Routing Algorithms Summer Science Research By: Kumar Chheda Research Mentor: Dr. Sean McCulloch.
21-May-15 Genetic Algorithms. 2 Evolution Here’s a very oversimplified description of how evolution works in biology Organisms (animals or plants) produce.
Genetic Algorithms, Part 2. Evolving (and co-evolving) one-dimensional cellular automata to perform a computation.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Mathematics 191 Research Seminar in Mathematical Modeling 28 March 2005 Rapid Modeling and Tractability.
Von Neumann’s Automaton and Viruses Most slides taken from Weizmann Institute of Science and Rensselaer Polytechnic Institute.
SM3121 Software Technology Mark Green School of Creative Media.
Today’s Plan Introduction to Artificial Life Cellular Automata
Design and Analysis of Algorithms
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Does not Compute 3: Awesomer Cellular Automata In which we consider how to upgrade our cellular automata A few key choices are considered, but eventually.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Computer Science Science of Computation Omer Reingold.
Chapter 12: Simulation and Modeling
Computers in the real world Objectives Understand what is meant by memory Difference between RAM and ROM Look at how memory affects the performance of.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
Adapting Convergent Scheduling Using Machine Learning Diego Puppin*, Mark Stephenson †, Una-May O’Reilly †, Martin Martin †, and Saman Amarasinghe † *
Recursion, Complexity, and Searching and Sorting By Andrew Zeng.
More Accurate Rate Estimation CS 170: Computing for the Sciences and Mathematics.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Computer Science Dept, San Jose State University, CA Self Reproducing CA’s and Programs Shruti Parihar May 06, 2003.
Art 315 Lecture 6 Dr. J. Parker. Variables Variables are one of a few key concepts in programming that must be understood. Many engineering/cs students.
Recursion, Complexity, and Sorting By Andrew Zeng.
Does not Compute 4: Finite Automata In which we temporarily admit defeat with cellular automata (we will face them again, in the epic final “Does Not Compute”
The Origin of Life Accident or Design? Robert C. Newman.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Chapter 7 File I/O 1. File, Record & Field 2 The file is just a chunk of disk space set aside for data and given a name. The computer has no idea what.
Using Evolutionary Computation as a Creativity-Support Tool Tim ChabukUniversity of Maryland Jason LohnCarnegie Mellon University Derek LindenX5 Systems.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
Computer Simulations of Evolution Robert C. Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
CSE 311 Foundations of Computing I Lecture 26 Computability: Turing machines, Undecidability of the Halting Problem Spring
CSE 311 Foundations of Computing I Lecture 29 Computability: Turing machines, Undecidability of the Halting Problem Autumn 2012 CSE 3111.
Creation by Steve Grand Chapters The Main Idea Chapter 11 “Igor, Hand Me That Screwdriver” “Life is not the stuff of which it is made – it is an.
STAR Event data storage and management in STAR V. Perevoztchikov Brookhaven National Laboratory,USA.
WILLIAM PALEY "If we received a single intelligent signal containing information from space then we would conclude that there is intelligent.
Computer Viruses. CONTENTS Origin of life Computer Virus How it occurs How to Detect.
Darwinian evolution MORE THAN JUST A THEORY?. DO YOU AGREE?
Stored Programs In today’s lesson, we will look at: what we mean by a stored program computer how computers store and run programs what we mean by the.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
A few of the people involved and what they’ve done.
1 ENG224 INFORMATION TECHNOLOGY – Part I 1. Introduction to Computers.
TRU-COMP3710 Artificial Life and Emergent Behavior1 Course Outline Part I – Introduction to Artificial Intelligence Part II – Classical Artificial Intelligence.
CompSci On the Limits of Computing  Reasons for Failure 1. Runs too long o Real time requirements o Predicting yesterday's weather 2. Non-computable.
Know what a computer is used for Understand the difference between hardware and software Be able to describe the way that data is stored in a computer.
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
The Origin of Life Accident or Design? Robert C. Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
The awesome power of the notion of Computational Universality suggests a complementary thesis It from Bit: Physics is Informational Dynamics should be.
Revision Notes Courtesy of Mr Dixon. Instructions This PowerPoint has all the information you need to complete your Revision Booklets for the Science.
CompSci Today’s Topics Computer Science Noncomputability Upcoming Special Topic: Enabled by Computer -- Decoding the Human Genome Reading Great.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
CSE 311 Foundations of Computing I
Theory of Computation Turing Machines.
Topic 1: Problem Solving
G5BAIM Artificial Intelligence Methods
A Gentle introduction Richard P. Simpson
Von Neumann’s Automaton and Viruses
Presentation transcript:

Computer Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Origin of Life Many talk today as though life came about by purely natural processes, and it’s only a matter of time until we learn how it happened. Here we suggest that life is far more complex than most people think, and it is hardly likely to have happened by chance. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Origin of Life Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Topics of Discussion In thinking about the complexity of life, we will take a different tack than is usual. We will look at computers rather than biology. We want to look at: Computer Viruses Artificial Life Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Computer Viruses What are computer viruses? Computer programs which invade a computer and try to take over its functions, rather like biological viruses do with human cells. Most of us with computer experience have had to deal with such viruses from time to time. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Computer Viruses Excellent discussion in Mark Ludwig, Computer Viruses, Artificial Life & Evolution. CVs are closer to artificial life than anything else humans have made. They are able to reproduce. They can often hide from predators. They can survive outside captivity. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Origin of Computer Viruses No one claims they arose by chance. They are designed by intelligent (if malevolent) creators. How likely would it be for something as complex as a computer virus to arise by chance in the computer environment? Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

How Likely to Arise by Chance? Ludwig's "First International Virus Writing Contest" (1993) Devise shortest virus possible. Must have certain minimal functions. Ludwig gives a sample, the grand prize winner, and several runners-up. All are over 100 bytes in length. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

How Likely to Arise by Chance? Shortest virus is 101 bytes There are possible files of length 101 bytes. If we have all 100 million PCs in world run full-time, making only 101-byte files at 1000/sec: Probability (hist univ) = 4 x If every elementary particle in universe such a PC, then Probability = 6 x Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Summary on Computer Viruses Even very simple computer viruses are very complex from the viewpoint of random assembly. So we can see why no one thinks computer viruses formed by accident. But perhaps some other form of artificial life will show us how this could have happened. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Artificial Life What is artificial life? Attempts to mimic or reproduce life by human ingenuity. The term is commonly used today for attempts to mimic life by computer simulation, rather than by building up life from its basic biological components. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Making Artificial Life Over 50 years ago, John von Neumann sought to design a self-reproducing automaton. He imagined a rectangular array of identical computer chips, each wired to four neighbors. Though identical, the chips will behave differently depending on what operational state each is in. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Von Neumann's Chips Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Von Neumann's Automaton Unit Under Construction Memory Control Constructing Unit Instruction Tape Constructing Arm Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Von Neumann's Automaton Memory Control Unit – 300 x 500 chips Constructing Unit – 300 x 500 chips Instruction Tape – 150,000 chips Whole thing about as complicated as a modern computer! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Langton's Simple Automaton Much simpler than von Neumann’s Modified a small component part of a previous automaton so that it would reproduce itself A 10 x 10 loop with a 5 x 3 arm The "instruction tape" fits inside and extends arm by 6 units, turns left, repeats this 3 times, till arm collides with self, breaks off new loop and makes new arms for each. Reproduces in 151 time-steps Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Langton's Simple Automaton Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Langton's Simple Automaton Bottom panel shows later generations: Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Byl's Simpler Automaton T = 0 T = 5 T = T = 15 T = 20 T = Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Ludwig's Simpler Automaton T = 0 T = 1 T = 2 T = 3 T = 4 T = Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Probabilities for Random Formation Langton's Automaton P (hist univ) = 1 x Byl's Automaton P (hist univ) = 1 x Ludwig's Automaton P(Byl assump) = 1 every sec P(more reasonable) = 1 x Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Problems w/ Simple Automata Not good for anything but reproduction. Reproduction typically collapses with any mutation. A viable automaton will need to be able to reproduce while changing. Thus we need to add more chip states, increasing complexity. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

A "Life" Automaton Try to be more general than three above automata. Don't tie to substrate especially designed for automaton. Use John Conway's game "Life" as substrate. Simplest reproducer is enormously complex, like von Neumann's! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

The Problem of Fragility All these automata run in an empty environment. What happens if they contact other objects in their space? Have tested Langton automaton for this; results are disastrous. Automaton is too fragile to function in such a space. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Summary on Automata Universal constructors far too complex. Special constructors too specialized, too fragile to handle mutations. Need to build automata that are: general enough to be flexible, are robust, and not too complex to form randomly. This looks to be impossible. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

Real Life So far, the artificial life project is like the biological origin-of-life project. Both have produced some minor results, which have been hyped far out of proportion to their actual significance. Researchers realize you can't get funding if the funders think the project is hopeless! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

What This Means Don't mistake research proposals for results! Don't mistake worldview-driven visions for a view of the real world. The results look far more like evidence of intelligent design. Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

What This Means Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

For Further Reading… My article "Artificial Life & Cellular Automata" in Mere Creation: Science, Faith & Intelligent Design, edited by William Dembski Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org

The End … Will man-made simulations prove life happened by itself? Don't count on it! Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org