Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.

Slides:



Advertisements
Similar presentations
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Advertisements

1 Stefano Redaelli LIntAr - Department of Computer Science - Unversity of Milano-Bicocca Space and Cellular Automata.
The Dynamic Geometry of Geographical Vector Agents Yasser Hammam, Antoni Moore, Peter Whigham and Claire Freeman* Spatial Information Research Centre,
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Central question for the sciences of complexity. How do large networks with.
Cellular Automata, Part 2. What is the relationship between the dynamics of cellular automata and their ability to compute?
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
Network Morphospace Andrea Avena-Koenigsberger, Joaquin Goni Ricard Sole, Olaf Sporns Tung Hoang Spring 2015.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Simulation Models as a Research Method Professor Alexander Settles.
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
Today’s Plan Introduction to Artificial Life Cellular Automata
A New Kind of Science in a Nutshell David Sehnal QIPL at FI MU.
Two Dimensions and Beyond From: “ A New Kind of Science” by Stephen Wolfram Presented By: Hridesh Rajan.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
CITS4403 Computational Modelling Fractals. A fractal is a mathematical set that typically displays self-similar patterns. Fractals may be exactly the.
Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7: , 2001 Summarized by In-Hee Lee.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
1 Evolutionary Growth of Genomes for the Development and Replication of Multi-Cellular Organisms with Indirect Encodings Stefano Nichele and Gunnar Tufte.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
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.
Chaos and Self-Organization in Spatiotemporal Models of Ecology J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the Eighth.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Conceptual Foundations © 2008 Pearson Education Australia Lecture slides for this course are based on teaching materials provided/referred by: (1) Statistics.
1 GECCO 2011 Graduate Student Workshop ”Discrete Dynamics of Cellular Machines: Specification and Interpretation” Stefano Nichele 2011, July 12th Stefano.
Trajectories and attractor basins as a behavioral description and evaluation criteria for artificial EvoDevo systems Stefano Nichele – October 14, 2009.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
1 Computer Science Graduate Student Conference 2011 ”On the Edge of Chaos and Possible Correlations Between Behavior and Cellular Regulative Properties”
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Machine Learning: Social and Emergent Luger: Artificial.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
The Science of Complexity J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the First National Conference on Complexity.
Geosimulation Geosimulation models are developed to represent phenomena that occur in urban systems in highly realistic manner In particular, Cellular.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Agent Based Modeling (ABM) in Complex Systems George Kampis ETSU, 2007 Spring Semester.
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.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
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.
제 4 주. Cellular Automata A Brief history of Cellular Automata P. Sarkar, ACM Computing Surveys, vol. 32, no. 1, pp. 80~107, 2000 학습목표 계산도구로서의 Cellular.
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Elements of a Discrete Model Evaluation.
What is Evolution? How do things Evolve?. Ok, we have created the Earth Earth about 4.0 Ga. We now want to follow its evolution from past to present But.
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?
Predicting permit activity with cellular automata calibrated with genetic algorithms Sushil J. LouisGary Raines Department of Computer Science US Geological.
1 GEK1530 Frederick H. Willeboordse Nature’s Monte Carlo Bakery: The Story of Life as a Complex System.
Janine Bolliger Swiss Federal Research Institute WSL/FNP,
Evolutionary Robotics The Genotype-to-Phenotype Map The genotype to phenotype map: the algorithm that transforms the genotype into the phenotype. Direct.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
Computing Systems Lecture 12 Future Computing. Natural computing Take inspiration from nature for the development of novel problem-solving techniques.
Modelagem Dinâmica com TerraME Aula 5 – Building simple models with TerraME Tiago Garcia de Senna Carneiro (UFOP) Gilberto Câmara (INPE)
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Chaotic Behavior - Cellular automata
Spatio-Temporal Information for Society Münster, 2014
On Routine Evolution of Complex Cellular Automata
Illustrations of Simple Cellular Automata
Alexei Fedorov January, 2011
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Cellular Automata Hiroki Sayama
An Overview of Evolutionary Cellular Automata Computation
Cellular Automata What could be the simplest systems capable of wide-ranging or even universal computation? Could it be simpler than a simple cell?
Alloy = FOL + transitive closure + sets + relations
Cellular Automata (CA) Overview
Complexity as Fitness for Evolved Cellular Automata Update Rules
Presentation transcript:

Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department of Computer Science Iona College and anonymous from Internet

Morphogenetic modeling Dynamical Systems and Cellular Automata

matter heat matter heat matter energy matter energy entropy dissipator Organisms are dissipative processes in space and time

Dynamical system Time Space Energy Position, energy, behavior, etc – state is changing in time according to certain dynamics

Which space? - which geometry? parameter space a b geometric space x y state space morphometric space Q=S/A S A ? time velocity  A good source of this kinds of problems may be robots for robot soccer, robot colony, bee hive modeling, ants, termites, etc.

Which space? - which geometry? ? parameter space genotype environment state space phylogeny/ontogeny morphometric space morphology geometric space ontogeny/phenotype Dynamics evolves, we can use evolutionary algorithms. Concepts of genotype versus phenotype.

discrete time steps T=0,1,2,3,… discrete cells at X,Y,Z=0,1,2,3,... discretize cell states S=0,1,2,3,... Discretization has many aspects t t+1 t+2 We can mix discrete and continuous values in some models

One Dimensional Cellular Automaton: A more general view t t+1 update rules neighbours In standard CA the values of cells are discretized F can be a complex program, but always synchronized to macro- pulses – example is SAT solver that will be discussed Think how can you use this concept to solve SAT?

Reduce dimensions: D=1, i.e. array of cells Reduce # of cell states: binary, i.e. 0 or 1 Simplify interactions: nearest neighbours Simplify update rules: deterministic, static Components of a maximal problem simplification to create a Cellular Automaton Try to think what kind of practical applications can be found for this kind of models. We will discuss them later on but may be you will invent now something new!

Effects of simplification You can model life and physical, chemical, biological and social phenomena on many levels of detail.

  Wolfram's 1D binary CA cell array binary states 5 nearest neighbours „sum-of-states“ update rule: cell array binary states 5 nearest neighbours „sum-of-states“ update rule: Wolfram, S., Physica 10D (1984), 1-35 Observe importance of symmetry of logic function We calculate how many neighbors are “1”, we don’t care which neighbors

  CA rules are now based on Symmetry S  { 0,1 }   { 1,2,3,4,5 } S  2 5 =32 different rules We calculate how many neighbors are “1”, we don’t care which neighbors Recall lattices and symmetry indices from ECE 572 class Observe that some kind of symmetry is fundamental to all science and biology. Symmetry simplifies rules of Nature. i.e. placing ones or zeros in five places

Code for rule 6 (00110) 0 S (i,T+1)  neighbours We calculate how many neighbors are “1”, we don’t care which neighbors Rule 6 tells that if sum is 3 or 4 than next state is alive This is only a simple example

How to encode the rules in a simple and logical way? rule 0 rule 1 rule 2 rule 3 rule 4 rule 5 rule 32 The fact that rules are binary string is very useful, for instance GA can be used. The encoding results from the way of specifying symmetric functions.

Temporal evolution of a Cellular Automaton initial configuration (t=0) e.g. random 0/1 t=1 t=2 t=3 rule n Please do not mislead the temporal evolution of the system with given set of rules with the evolution of the set of rules.

Temporal evolution t=0 t=10

Rule 6: t=100 t=0

Rule 10: t=100 t=0 Interpretation: changing only two bits in rules (genotype) changes the dynamics of life (phenotype)

CA: a metaphor for morphogenesis static binary pattern translated into state transition rule rule iteration in configuration space genotype translation, epigenetic rules morphogenesis of the phenotype   1   0   1   0  

CA: a model for morphogenesis update rule iterative application of the update rule CA state pattern state space genotype epigenetic interpretation of the genotype, morphogenesis phenotype morphospace

CA rule mutations swap genotypephenotypedevelopment negate How genotype mutations can change phenotypes? Small change in genetype changes phenotype

CA rule mutations negate swap rule

Predictability? pattern at t+  t pattern at t explicit simulation:  iterations of rule n ? hypothetical "simple algorithm" ? How to predict a next element in sequence? Tough!

Sum of natural numbers 1… N algorithm 1: 1+2+…+N algorithm2: N(N+1)/2 (Gaussian formula) Sum of natural numbers 1… N algorithm 1: 1+2+…+N algorithm2: N(N+1)/2 (Gaussian formula) Predictability Nth prime number algorithm 1: trial and error algorithm2: ? no general formula Nth prime number algorithm 1: trial and error algorithm2: ? no general formula easyVery tough! Given a number N predict the sum of numbers from 1 to N. Given a number N predict the N-th prime number

CA: there is no effective prediction method for patterns pattern at t+  t pattern at t behavior may be determined only by explicit simulation

CA: deterministic, unpredictable, irreversible Simple rules generate complex spatio-temporal behavior For non-trivial rules, the spatio-temporal behaviour is computable but not predictable The behavior of the system is irreversible Similarity of rules does not imply similarity of patterns Simple rules generate complex spatio-temporal behavior For non-trivial rules, the spatio-temporal behaviour is computable but not predictable The behavior of the system is irreversible Similarity of rules does not imply similarity of patterns

Aspects of CA morphogenesis complex relationship between „genotype“ and „phenotype“ pheneseffects of „genes“ are not localizable in specific phenes (pleiotropy) epistasisphenes cannot be traced back to specific single genes (epistasis) phenetic effects of "mutations" are not predictable

Meinhardt, H. (1995). The Algorithmic Beauty of Sea Shells. Berlin: Springer

Patterns and morphology Pattern: a spatially and/or temporally ordered distribution of a physical or chemical parameter Pattern formation Form (Size and Shape) Morphogenesis: The spatio-temporal processes by which an organism changes is size (growth) and shape (development)

Where is the phene? Typification? Comparative measures? –length –density –fractal dimension Spatio-temporal development? phenotype A phenotype B All active research areas!