1 Cellular Automata What could be the simplest systems capable of wide-ranging or even universal computation? Could it be simpler than a simple cell?

Slides:



Advertisements
Similar presentations
Microsoft® Office Word 2007 Training
Advertisements

Reversible Cellular Automata CS240 Kwnaghyun Paek.
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Copyright Kenneth M. Chipps Ph.D. FLSM Last Update
CITS4403 Computational Modelling Game of Life. One of the first cellular automata to be studied, and probably the most popular of all time, is a 2-D CA.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
Mr Barton’s Maths Notes
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
CELLULAR AUTOMATON Presented by Rajini Singh.
Traffic Light Behavior IF A=1 AND B=0 Car Sensors B A.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Exponents Scientific Notation
Lesson 4: Percentage of Amounts.
A New Kind of Science in a Nutshell David Sehnal QIPL at FI MU.
A New Kind of Science Chapter 3 Matthew Ziegler CS 851 – Bio-Inspired Computing.
Two Dimensions and Beyond From: “ A New Kind of Science” by Stephen Wolfram Presented By: Hridesh Rajan.
CITS4403 Computational Modelling Fractals. A fractal is a mathematical set that typically displays self-similar patterns. Fractals may be exactly the.
Lecture for Week Spring.  Numbers can be represented in many ways. We are familiar with the decimal system since it is most widely used in everyday.
Positional Number Systems
Maths Notes Number 5. Decimals
Triangle Town Hi, I’m Elke. Pleased to be your guide through Triangle Town. Don’t ever worry about getting lost. I’ll stay with you the whole time.
1 Are these nodes related to graph theory? Or they can provide us an idea to use the graph theory or network theory as a tool to unravel the secrets of.
Copyright © Cengage Learning. All rights reserved. 5 Probability Distributions (Discrete Variables)
Dynamic Models of Segregation
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
EXIT NEXT Click one of the buttons below or press the enter key BACKTOPICSProbability Mayeen Uddin Khandaker Mayeen Uddin Khandaker Ph.D. Student Ph.D.
Extending the Definition of Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 -8.
Digital Logic Computer Organization 1 © McQuain Logic Design Goal:to become literate in most common concepts and terminology of digital.
5.3 Geometric Introduction to the Simplex Method The geometric method of the previous section is limited in that it is only useful for problems involving.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Fractals. In colloquial usage, a fractal is "a rough or fragmented geometric shape that can be subdivided in parts, each of which is (at least approximately)
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
Investigational Work Following through and seeing the steps and paths that MAY be taken.
GEM A Finance Survival Kit GEM2508 Frederick H. Willeboordse
GEK Frederick H. Willeboordse Compound & Prosper!
Copyright © Cengage Learning. All rights reserved. 5 Probability Distributions (Discrete Variables)
1 Lesson Mean and Range. 2 Lesson Mean and Range California Standard: Statistics, Data Analysis, and Probability 1.1 Compute the range, mean,
CS1Q Computer Systems Lecture 7
1 GEK1530 Frederick H. Willeboordse Nature’s Monte Carlo Bakery: The Story of Life as a Complex System.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Number Systems & Operations
Algebraic Thinking 5 th Grade Guided Instruction Finding Rules and Writing Equations For Patterns.
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
A New Kind of Science by Stephen Wolfram Principle of Computational Equivalence - Ting Yan,
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Cellular Automata FRES 1010 Eileen Kraemer Fall 2005.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
More – means the number is bigger like an elephant. Less – means the number is smaller like a mouse.
SM2220 – Class 06 Finite Automata. SM2220 – Class 06 Topic in theoretical computing. A subset of computation machines. Closely related to formal language.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
Journal Format and Grading First, you MUST have a standard 100 sheet, 7 ½” x 9 ¾” composition book just for science class. No spiral bound notebooks! Tahoma.
Chapter 3 Special Section Focus on Karnaugh Maps.
1 GEK1530 Frederick H. Willeboordse Nature’s Monte Carlo Bakery: The Story of Life as a Complex System.
 Columns  Rows  Cells  Ranges  Cell addresses  Column headers  Row headers  Formulas  Spreadsheet.
Dynamic Dots Moving from the known to the unknown.
Mathematical Foundations of Computer Science Chapter 3: Regular Languages and Regular Grammars.
An Introduction to Prime Factorization by Mrs. Gress
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
Spatio-Temporal Information for Society Münster, 2014
Exponents Scientific Notation
Copyright © Cengage Learning. All rights reserved.
Stuart Smith “Natural” Shapes Stuart Smith
What do we now know about number systems?
Alexei Fedorov January, 2011
Cellular Automata What could be the simplest systems capable of wide-ranging or even universal computation? Could it be simpler than a simple cell?
Presentation transcript:

1 Cellular Automata What could be the simplest systems capable of wide-ranging or even universal computation? Could it be simpler than a simple cell?

GEK Perhaps one can expect that strange and complex behavior results from very complicated rules. But what are the simplest systems that display complex behavior? This is an important question when we want to figure out whether relatively simple rules could underlie the complexity of life. As it turns out, probably the simplest systems that display complex behaviors are the so-called cellular automata. Cellular Automata

GEK Born in 1959 in London First paper at age 15 Ph.D. at 20 Youngest recipient of MacArthur ‘young genius’ award Worked at Caltech and Princeton Owner of Mathematica (Wolfram Research) Fantastic publication record … until … 1988 when he stopped publishing in scientific journals From his web site … Stephen Wolfram Cellular Automata

GEK A (one-dimensional) cellular automaton consists of a line of ‘cells’ (boxes) each with a certain color like e.g. black or grey and a rule on how the colors of the cells change from one time step to the next. Rule Line The first line is always given. This is what is called the ‘initial condition’. This rule is trivial. It means black remains black and grey remains grey. Time 0 Time 1 Time 2 This is how the Cellular Automaton evolves Cellular Automata

GEK A (one-dimensional) cellular automaton consists of a line of ‘cells’ (boxes) each with a certain color like e.g. black or grey and a rule on how the colors of the cells change from one time step to the next. Rule Line The first line is always given. This is what is called the ‘initial condition’. Another simple rule. It means black turns into grey and grey turns into black. Time 0 Time 1 Time 2 This is how the Cellular Automaton evolves Cellular Automata

GEK Like this, the rules are a bit boring of course because there is no spatial dependence. That is to say, neighboring cells have no influence. Therefore, let us look at rules that take nearest neighbors into account. or With 3 cells and 2 colors, there are 8 possible combinations. Cellular Automata

GEK The 8 possible combinations: Of course, for each possible combination we’ll need to state to which color it will lead in the next time step. Let us look at a famous rule called rule 254 (we’ll get back to why it has this name later). Cellular Automata

GEK Rule 254: We can of course apply this rule to the initial condition we had before but what to do at the boundary? Rule 254: Cellular Automata

GEK Often one starts with a single black dot and takes all the neighbors on the right and left to be grey (ad infinitum). Now, let us apply rule 254. This is quite simple, everything, except for three neighboring grey cells will lead to a black cell. 254: Cellular Automata

GEK Continuing the procedure: 254: Time 0 Time 1 Time 2 Time 3 Cellular Automata

GEK Of course we don’t really need those arrows and the time so we might just as well forget about them to obtain: 254: Nice, but well … not very exciting. Cellular Automata

GEK So let us look at another rule. This one is called rule 90. That doesn’t look like it’s very exciting either. What’s the big deal? Rule 90: Cellular Automata

GEK Applying rule : At least it seems to be a bit less boring than before…. After one time step: After two time steps: Cellular Automata

GEK Applying rule : Hey! This is becoming more fun…. After three time steps: Cellular Automata

GEK Applying rule : Hmmmm After four time steps: Cellular Automata

GEK Applying rule : It’s a Pac Man! After five time steps: Cellular Automata

GEK Applying rule : Which is a fractal! Well not really. It’s a Sierpinsky gasket: Cellular Automata

GEK Applying rule : Well not really. It’s a Sierpinsky gasket: From S. Wolfram: A new kind of Science. Cellular Automata

GEK So we have seen that simple cellular automata can display very simple and fractal behavior. Both these patterns are in a sense highly regular. One may wonder now whether ‘irregular’ patterns can also exist. Rule 30: Surprisingly they do! Rule 30 Note that I’ve only changed the color of two boxes compared to rule 90. Cellular Automata

GEK Applying rule : Cellular Automata

GEK Applying rule : While one side has repetitive patterns, the other side appears random. From S. Wolfram: A new kind of Science. Cellular Automata

GEK Now let us look at the numbering scheme The first thing to notice is that the top is always the same. This is the part that changes. Now if we examine the top more closely, we find that it just is the same pattern sequence that we obtain in binary counting. Cellular Automata

GEK If we say that black is one and grey is zero, then we can see that the top is just counting from 7 to 0. Good. Now we know how to get the sequence on the top. Value 1 Value 4 Value 2 Value 1 Value 4 Value 2 = 4 = 3 Cellular Automata

GEK How about the bottom? We can do exactly the same thing but since we have 8 boxes on the bottom it’s counting from 0 to 255. = = 90 Value 128 Value 64 Value 16 Value 32 Value 8 Value 4 Value 2 Value 1 Cellular Automata

GEK Like this we can number all the possible 256 rules for this type of cellular automaton. Cellular Automata

GEK Like this we can number all the possible 256 rules for this type of cellular automaton. Cellular Automata

GEK Like this we can number all the possible 256 rules for this type of cellular automaton. And of course, one does not need to restrict oneself to two colors and two neighbors … Cellular Automata

GEK Wrapping up Key Points of the Day Give it some thought Can you think of any ‘real-life’ cellular automata? Simple dynamical rules can lead to complex behavior Cellular automaton rule 90: