Cellular Automata CS 591 Complex Adaptive Systems Spring Professor: Melanie Moses 2/02/09
|
|
- Lucy Gregory
- 5 years ago
- Views:
Transcription
1 Cellular Automata CS 591 Complex Adaptive Systems Spring 2009 Professor: Melanie Moses 2/02/09
2 Introduction to Cellular Automata (CA) Invented by John von Neumann (circa~1950). A cellular automata consists of: A regular arrangement (lattice) of cells. Cells can be in one of a finite number of states at each time step. All cells have the same synchronous update rule. Cells have a local interaction neighborhood. Example: The game of life. Many cellular automata applications: Hydrodynamics, fluid dynamics Forest fire simulation Models of ecosystems, epidemics and economies Ferro-magnetic modeling (ISING models)
3 One-Dimensional CA Illustration r t i - r... i - 1 i i+1... i+r t+1 i ηi φ
4 One-Dimensional Cellular Automaton (CA) Consists of a linear array of identical cells (called a lattice), each of which can be in a finite number of k states. The (local) state of cell i at time t is denoted: s i t Σ = { 0,1,..., k 1} The (global) state s t at time t is the configuration of the entire array, s t = ( s 0 t, s N 1 t ) where N is the size of the array. 1 t,..., s Σ N
5 One-Dimensional CA cont. At each time step, all cells in the array update their state simultaneously, according to a local update rule φ : η s. This update rule takes as input the local neighborhood configuration η of a cell. A local neighborhood configuration η consists of s i and its 2r nearest neighbors (r cells on either side): η = ( s i i r,..., s,..., s i+ r ) r is called the radius of the CA. The local update rule φ, which is the same for every cell in the array, can be represented as a lookup table, which lists all 2 r+1 possible neighborhood configurations ( η = k ) i i s = φ ( η ) t+ 1 t
6 One-Dimensional CA Illustration r t i - r... i - 1 i i+1... i+r t+1 i ηi φ
7 Flake ch 15, rule 6 C i-1 (t) C i (t) C i+1 (t) C i (t+1) Wolfram rule: Sum to 0 --> > > > = rule 6 Constrain the rules so the sum of states in the neighborhood determines the state at time t+1 How many rules are there for arbitrary k and r?
8 Wolfram s CA Classification Class I: Eventually every cell in the array settles into one state, never to change again. Analogous to computer programs that halt after a few steps and to dynamical systems that have fixed-point attractors. Class II: Eventually the array settles into a periodic cycle of states (called a limit cycle). Analogous to computer programs that execute infinite loops and to dynamical systems that fall into limit cycles. Class III: The array forms aperiodic random-like patterns. Analogous to computer programs that are pseudo-random number generators (pass most tests for randomness, highly sensitive to seed, or initial condition). Analogous to chaotic dynamical systems. Almost never repeat themselves, sensitive to initial conditions, embedded unstable limit cycles.
9 Wolfram s Classification cont. Class IV: The array forms complex patterns with localized structure that move through space and time: Difficult to describe. Not regular, not periodic, not random. Speculate that it is interesting computation. Hypothesis: The most interesting and complex behavior occurs in Class IV CA---the edge of chaos. Example: Rule 110
10 Wolfram Class I
11 Wolfram s Class II
12 Wolfram s Class III
13 Rule 30 current pattern new state for center cell
14 Comments on Rule 30 Generates apparent randomness, despite being finite Wolfram proposed using the central column as a pseudo -random number generator Passes many tests for randomness, but many inputs produce regular patterns: All zeroes repeated infinitely (try separating by 6 1s) Used in Mathematica for creating random integers (Wikipedia)
15 Wolfram s Class IV
16 Example Class IV One-Dimensional CA Rule 110 The number of states, k=2. The alphabet Σ = {0,1} Σ = k The size of the array, N=11. The configuration space η Σ N The radius r = 1. The rule table : = {(0,0,0,0,0,0,0,0,0,0,0),(0,0,0,0,0,0,0,0,0,0,11),...} neighborhood : : φ s i t+ 1 = φ ( η This is rule 110 (base 10) because the output states are: (base 2--known as Wolfram notation). In Flake s sum notation? Rule 110 supports universal computation. i t )
17 Rule Table φ : Neighborhood: Output bit: Lattice: Periodic boundary conditions Neighborhood η t = t =
18 Rule 110 Space-Time Plot
19 Monday 02/09/09 Matlab Fire Model Assignment 1 Langston s lambda The Game of Life CA s as models of real biological systems SIR model of disease spread Readings for Wed and Friday
20 Langton s Lambda Parameter Wolfram s classification scheme is phenomenological (argument by visual inspection of space-time diagrams). Chris Langton (1986) quantified the classification scheme by introducing the parameter λ. Lambda is a statistic of the output states in the CA lookup table, defined as the fraction of non-quiescent states in this table. The quiescent state is an arbitrarily chosen state s Σ Example: For a 2-state CA ( Σ = {0,1} ), and quiescent state s=0, lambda is the fraction of 1s in the output states of φ.
21 λ = Lambda Parameter η n q η Where n q = the number of rules that map to the quiescent state. CA behavior is interesting when 0 λ k Calculate λ for rule 6
22 From Flake ch 15, rule 6 C i-1 (t) C i (t) C i+1 (t) C i (t+1) Wolfram sum rule Sum to 0 --> > > > = rule 6 η n q λ = η Sum rule: 0110 To calculate λ convert sum notation to full rule table Wolfram rule: = rule 116 = representation of all rules: λ = 1-1/k = 1/2 Interesting cases : 0 < λ < 1/2 For sum rule 0110, λ = 3/4
23 Lambda Space and Wolfram Classes 0 λ c k
24 Entropy and Lambda K = 4, N = 5
25 Length of Transients Depends on Lambda
26 Comments on the Lambda Parameter Table walkthrough illustrates interesting change in dynamics as function of lambda: Transient lengths increase dramatically in middle of the range Size of the array has an effect on dynamics only for intermediate values of lambda. Transient length depends exponentially on array size at lambda = 0.5. Overall evolutionary pattern in time is more random as lambda increases past the transition region (use entropy and mutual information). Transition region supports both static and propagating structures.
27 Comments on the Lambda Parameter Claims: There is a phase transition between periodic and chaotic behavior. Most complex behavior is in the vicinity of the transition: The edge of chaos. CA s near the transition point correspond to Wolfram s Class IV. CA s capable of performing complex computations will be found near the transition point (long transients). E.g., the game of life has lambda=0.273 (in the transition region for K=2, N=9 2D CA s). Criticisms of the Lambda parameter: CA s with high lambda-value can still have simple behavior. Lambda describes average behavior. Lambda does not take the initial state of the computation into account
28 Computation in CA vs CA as models of Complex Systems CA s as computers: Initial configuration constitutes the data that the physical computer is processing. Transition function implements the algorithm which is applied to the data. Examples: Majority calculations, synchronization (Mitchell and Crutchfield). CA s as logical universes within which computers can be embedded: Initial configuration constitutes a computer. Transition function is the physics obeyed by the parts of the embedded computer. The algorithm and data are functions of the precise state of the initial configuration of the embedded computer. In the most general case, the initial configuration is a universal computer. Examples: Rule 110, Game of life CAs are networks of FSAs that can implement storage, counting, logical operators CA as models Implement rules that mimic real systems in order to predict their behavior Attempt to understand rules by matching emergent behavior to real systems
29 The Game of Life The number of states, k=2. The alphabet, Σ = {0,1} Call 0 dead and 1 alive. The Moore neighborhood: NW W N NE E SW S SE Transition rules: Loneliness: If a live cell has less than 2 live neighbors, then it dies. Overcrowding: If a live cell has more than 3 live neighbors, then it dies. Birth: If an empty (dead) cell has 3 live neighbors, then it becomes alive. Otherwise: If a cell has 2 or 3 live neighbors, then it remains unchanged. You will use the GoL to implement a model of disease spread
30 Moore vs. Von Neumann Neighborhoods NW N NE N W E W E SW S SE S Moore Von Neumann
31 Example Transition Center square changes to one (birth). Just 3 for birth, 2 or 3 for survival.
32 Structures in Life Dynamical behaviors that enable universal computation Dynamical behaviors that enable persistence? Static structures: Beehive, Loaf, Pond, etc. (Figure 15.11) Periodic structures: Blinkers (Figure 15.12) Moving structures: Gliders Glider guns Logical gates (and, or, not) Self-reproducing structures.
33 Static Objects
34 Periodic Objects
35 Gliders (Moving Objects)
Mitchell Chapter 10. Living systems are open systems that exchange energy, materials & information
Living systems compute Mitchell Chapter 10 Living systems are open systems that exchange energy, materials & information E.g. Erwin Shrodinger (1944) & Lynn Margulis (2000) books: What is Life? discuss
More informationIntroduction to Scientific Modeling CS 365, Fall 2011 Cellular Automata
Introduction to Scientific Modeling CS 365, Fall 2011 Cellular Automata Stephanie Forrest ME 214 http://cs.unm.edu/~forrest/cs365/ forrest@cs.unm.edu 505-277-7104 Reading Assignment! Mitchell Ch. 10" Wolfram
More informationII. Cellular Automata 8/27/03 1
II. Cellular Automata 8/27/03 1 Cellular Automata (CAs) Invented by von Neumann in 1940s to study reproduction He succeeded in constructing a self-reproducing CA Have been used as: massively parallel computer
More informationbiologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 12 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationII. Spatial Systems. A. Cellular Automata. Structure. Cellular Automata (CAs) Example: Conway s Game of Life. State Transition Rule
II. Spatial Systems A. Cellular Automata B. Pattern Formation C. Slime Mold D. Excitable Media A. Cellular Automata 1/18/17 1 1/18/17 2 Cellular Automata (CAs) Invented by von Neumann in 1940s to study
More informationII. Spatial Systems A. Cellular Automata 8/24/08 1
II. Spatial Systems A. Cellular Automata 8/24/08 1 Cellular Automata (CAs) Invented by von Neumann in 1940s to study reproduction He succeeded in constructing a self-reproducing CA Have been used as: massively
More informationCS 365 Introduc/on to Scien/fic Modeling Lecture 2: Cellular Automata
CS 365 Introduc/on to Scien/fic Modeling Lecture 2: Cellular Automata Stephanie Forrest Dept. of Computer Science Univ. of New Mexico Fall Semester, 2014 Reading Assignment Mitchell, Ch. 10, 2 Wolfram,
More informationMotivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems
Cellular Systems 1 Motivation Evolution has rediscovered several times multicellularity as a way to build complex living systems Multicellular systems are composed by many copies of a unique fundamental
More informationCellular Automata and Tilings
Cellular Automata and Tilings Jarkko Kari Department of Mathematics, University of Turku, Finland TUCS(Turku Centre for Computer Science), Turku, Finland Outline of the talk (1) Cellular automata (CA)
More informationModelling with cellular automata
Modelling with cellular automata Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about cellular
More informationCellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central
Cellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central control Complex dynamics from simple rules Capability of information
More informationCellular Automata. History. 1-Dimensional CA. 1-Dimensional CA. Ozalp Babaoglu
History Cellular Automata Ozalp Babaoglu Developed by John von Neumann as a formal tool to study mechanical self replication Studied extensively by Stephen Wolfram ALMA MATER STUDIORUM UNIVERSITA DI BOLOGNA
More informationAny live cell with less than 2 live neighbours dies. Any live cell with 2 or 3 live neighbours lives on to the next step.
2. Cellular automata, and the SIRS model In this Section we consider an important set of models used in computer simulations, which are called cellular automata (these are very similar to the so-called
More informationIntroduction to Artificial Life and Cellular Automata. Cellular Automata
Introduction to Artificial Life and Cellular Automata CS405 Cellular Automata A cellular automata is a family of simple, finite-state machines that exhibit interesting, emergent behaviors through their
More informationCellular Automata: Tutorial
Cellular Automata: Tutorial Jarkko Kari Department of Mathematics, University of Turku, Finland TUCS(Turku Centre for Computer Science), Turku, Finland Cellular Automata: examples A Cellular Automaton
More informationMoving Mass A Nonlinear Dynamics Project
Moving Mass A Nonlinear Dynamics Project by Jeff Hutchinson (hutchinson@student.physics.ucdavis.edu) & Matt Fletcher (fletcher@student.physics.ucdavis.edu) UC Davis Physics Dept. Spring 2008 Abstract:
More informationExtension of cellular automata by introducing an algorithm of recursive estimation of neighbors
Extension of cellular automata by introducing an algorithm of recursive estimation of neighbors Yoshihiko Kayama BAIKA Women s University, Japan (Tel: 81-72-643-6221, Fax: 81-72-643-8473) kayama@baika.ac.jp
More informationCellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.
and beyond Lindenmayer Systems The World of Simple Programs Christian Jacob Department of Computer Science Department of Biochemistry & Molecular Biology University of Calgary CPSC 673 Winter 2004 Random
More informationCellular Automata. Jason Frank Mathematical Institute
Cellular Automata Jason Frank Mathematical Institute WISM484 Introduction to Complex Systems, Utrecht University, 2015 Cellular Automata Game of Life: Simulator: http://www.bitstorm.org/gameoflife/ Hawking:
More informationChaos, Complexity, and Inference (36-462)
Chaos, Complexity, and Inference (36-462) Lecture 10 Cosma Shalizi 14 February 2008 Some things you can read: [1] is what got me interested in the subject; [2] is the best introduction to CA modeling code
More informationRevisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations
Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations Melanie Mitchell 1, Peter T. Hraber 1, and James P. Crutchfield 2 Abstract We present results from an experiment similar
More informationToward a Better Understanding of Complexity
Toward a Better Understanding of Complexity Definitions of Complexity, Cellular Automata as Models of Complexity, Random Boolean Networks Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science
More informationShannon Information (very briefly!) Lecture 4. Maximum and Minimum Entropy. Entropy. Entropy of Transition Rules. Entropy Examples
Lecture 4 9/4/07 1 Shannon Information (very briefly!) Information varies directly with surprise Information varies inversely with probability Information is additive The information content of a message
More informationChaos, Complexity, and Inference (36-462)
Chaos, Complexity, and Inference (36-462) Lecture 10: Cellular Automata Cosma Shalizi 12 February 2009 Some things you can read: Poundstone (1984) is what got me interested in the subject; Toffoli and
More informationComplexity Classes in the Two-dimensional Life Cellular Automata Subspace
Complexity Classes in the Two-dimensional Life Cellular Automata Subspace Michael Magnier Claude Lattaud Laboratoire d Intelligence Artificielle de Paris V, Université René Descartes, 45 rue des Saints
More informationDynamics and Chaos. Melanie Mitchell. Santa Fe Institute and Portland State University
Dynamics and Chaos Melanie Mitchell Santa Fe Institute and Portland State University Dynamical Systems Theory: The general study of how systems change over time Calculus Differential equations Discrete
More informationProject 1: Edge of Chaos in 1D Cellular Automata
CS 420/527: Biologically-Inspired Computation Project 1: Edge of Chaos in 1D Cellular Automata Due: Friday, Feb. 3, Midnight Introduction In this project you will explore Edge of Chaos phenomena (Wolfram
More informationCellular Automata. and beyond. The World of Simple Programs. Christian Jacob
Cellular Automata and beyond The World of Simple Programs Christian Jacob Department of Computer Science Department of Biochemistry & Molecular Biology University of Calgary CPSC / MDSC 605 Fall 2003 Cellular
More informationComputation in Cellular Automata: A Selected Review
Computation in Cellular Automata: A Selected Review Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 87501 U.S.A. email: mm@santafe.edu In T. Gramss, S. Bornholdt, M. Gross, M. Mitchell,
More informationXX Eesti Arvutiteaduse Talvekool
XX Eesti Arvutiteaduse Talvekool Cellular automata, tilings and (un)computability Jarkko Kari Department of Mathematics and Statistics University of Turku Lecture 1: Tutorial on Cellular automata Introduction
More informationCellular automata, tilings and (un)computability
Cellular automata, tilings and (un)computability Jarkko Kari Department of Mathematics and Statistics University of Turku, Finland Topics of the four lectures () Wang tiles: aperiodicity and undecidability
More information15-251: Great Theoretical Ideas in Computer Science Lecture 7. Turing s Legacy Continues
15-251: Great Theoretical Ideas in Computer Science Lecture 7 Turing s Legacy Continues Solvable with Python = Solvable with C = Solvable with Java = Solvable with SML = Decidable Languages (decidable
More informationCellular Automata. Jarkko Kari Spring University of Turku
Cellular Automata Jarkko Kari Spring 2 University of Turku Preliminaries. Introduction A cellular automaton is a discrete dynamical system that consists of a regular network of finite state automata (cells)
More informationCellular Automata. Jarkko Kari Spring University of Turku
Cellular Automata Jarkko Kari Spring 23 University of Turku Preliminaries. Introduction A cellular automaton is a discrete dynamical system that consists of a regular network of finite state automata (cells)
More informationCS 420/594: Complex Systems & Self-Organization Project 1: Edge of Chaos in 1D Cellular Automata Due: Sept. 20
CS 420/594: Complex Systems & Self-Organization Project 1: Edge of Chaos in 1D Cellular Automata Due: Sept. 20 Introduction In this project you will explore Edge of Chaos phenomena (Wolfram class IV behavior)
More informationJustine Seastres. Cellular Automata and the Game of Life
Justine Seastres Saint Mary s College of California Department of Mathematics May 16, 2016 Cellular Automata and the Game of Life Supervisors: Professor Porter Professor Sauerberg 2 Contents 1 Introduction
More informationP The Entropy Trajectory: A Perspective to Classify Complex Systems. Tomoaki SUZUDO Japan Atomic Energy Research Institute, JAERI
P 0 0 8 The Entropy Trajectory: A Perspective to Classify Complex Systems Tomoaki SUZUDO Japan Atomic Energy Research Institute, JAERI What are complex systems? Having macroscopic properties which are
More informationImage Encryption and Decryption Algorithm Using Two Dimensional Cellular Automata Rules In Cryptography
Image Encryption and Decryption Algorithm Using Two Dimensional Cellular Automata Rules In Cryptography P. Sanoop Kumar Department of CSE, Gayatri Vidya Parishad College of Engineering(A), Madhurawada-530048,Visakhapatnam,
More informationCellular Automaton Growth on # : Theorems, Examples, and Problems
Cellular Automaton Growth on : Theorems, Examples, and Problems (Excerpt from Advances in Applied Mathematics) Exactly 1 Solidification We will study the evolution starting from a single occupied cell
More informationNETWORK REPRESENTATION OF THE GAME OF LIFE
JAISCR, 2011, Vol.1, No.3, pp. 233 240 NETWORK REPRESENTATION OF THE GAME OF LIFE Yoshihiko Kayama and Yasumasa Imamura Department of Media and Information, BAIKA Women s University, 2-19-5, Shukuno-sho,
More informationBranislav K. Nikolić
Interdisciplinary Topics in Complex Systems: Cellular Automata, Self-Organized Criticality, Neural Networks and Spin Glasses Branislav K. Nikolić Department of Physics and Astronomy, University of Delaware,
More informationElementary cellular automata
Cellular Automata Cellular automata (CA) models epitomize the idea that simple rules can generate complex pa8erns. A CA consists of an array of cells each with an integer state. On each?me step a local
More informationLearning Cellular Automaton Dynamics with Neural Networks
Learning Cellular Automaton Dynamics with Neural Networks N H Wulff* and J A Hertz t CONNECT, the Niels Bohr Institute and Nordita Blegdamsvej 17, DK-2100 Copenhagen 0, Denmark Abstract We have trained
More informationStream Ciphers. Çetin Kaya Koç Winter / 20
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 20 Linear Congruential Generators A linear congruential generator produces a sequence of integers x i for i = 1,2,... starting with the given initial
More informationIntroduction to Dynamical Systems Basic Concepts of Dynamics
Introduction to Dynamical Systems Basic Concepts of Dynamics A dynamical system: Has a notion of state, which contains all the information upon which the dynamical system acts. A simple set of deterministic
More informationBio-inspired Models of Computation Seminar. Daniele Sgandurra. 16 October 2009
Bio-inspired Models of Computation Seminar Università di Pisa 16 October 2009 Outline Introduction Motivation History Cellular Systems Wolfram Classes Variants and Extensions Extended Topics Garden of
More informationThe Fixed String of Elementary Cellular Automata
The Fixed String of Elementary Cellular Automata Jiang Zhisong Department of Mathematics East China University of Science and Technology Shanghai 200237, China zsjiang@ecust.edu.cn Qin Dakang School of
More informationRadial View: Observing Fuzzy Cellular Automata with a New Visualization Method
Radial View: Observing Fuzzy Cellular Automata with a New Visualization Method Paola Flocchini and Vladimir Cezar School of Information Technology and Engineering University of Ottawa, 800 King Eduard,
More informationOutline 1 Introduction Tiling definitions 2 Conway s Game of Life 3 The Projection Method
A Game of Life on Penrose Tilings Kathryn Lindsey Department of Mathematics Cornell University Olivetti Club, Sept. 1, 2009 Outline 1 Introduction Tiling definitions 2 Conway s Game of Life 3 The Projection
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 1 Oct 1998
arxiv:cond-mat/9810012v1 [cond-mat.stat-mech] 1 Oct 1998 CELLULAR AUTOMATA FRANCO BAGNOLI Dipartimento di Matematica Applicata Università di Firenze, via S. Marta, 3 I-50139 Firenze Italy e-mail: bagnoli@dma.unifi.it
More informationMechanisms of Emergent Computation in Cellular Automata
Mechanisms of Emergent Computation in Cellular Automata Wim Hordijk, James P. Crutchfield, Melanie Mitchell Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, 87501 NM, USA email: {wim,chaos,mm}@santafe.edu
More informationWe prove that the creator is infinite Turing machine or infinite Cellular-automaton.
Do people leave in Matrix? Information, entropy, time and cellular-automata The paper proves that we leave in Matrix. We show that Matrix was built by the creator. By this we solve the question how everything
More informationTuring s Legacy Continues
15-251: Great Theoretical Ideas in Computer Science Lecture 6 Turing s Legacy Continues Solvable with Python = Solvable with C = Solvable with Java = Solvable with SML = Decidable Languages (decidable
More informationCellular automata, entropy and box- coun4ng dimension
Cellular automata, entropy and box- coun4ng dimension Cellular Automata Cellular automata (CA) models epitomize the idea that simple rules can generate complex pa=erns. A CA consists of an array of cells
More informationComputation by competing patterns: Life rule B2/S
Computation by competing patterns: Life rule B2/S2345678 Genaro J. Martínez, Andrew Adamatzky, Harold V. McIntosh 2, and Ben De Lacy Costello 3 Faculty of Computing, Engineering and Mathematical Sciences,
More informationNote that numerically, with white corresponding to 0 and black to 1, the rule can be written:
Cellular automata We discuss cellular automata as a simple application of MATLAB programming and as an accessible scientific topic of recent interest. You can find a lot of information on the internet.
More informationChaotic Subsystem Come From Glider E 3 of CA Rule 110
Chaotic Subsystem Come From Glider E 3 of CA Rule 110 Lingxiao Si, Fangyue Chen, Fang Wang, and Pingping Liu School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang, P. R. China Abstract The
More informationSymmetry and Entropy of One- Dimensional Legal Cellular Automata
Symmetry and Entropy of One- Dimensional Legal Cellular Automata Kazuhito Yamasaki Department of Earth and Planetary Sciences, Kobe University Nada, Kobe, 657-8501, Japan Kazuyoshi Z. Nanjo Earthquake
More informationDevelopments In Ecological Modeling Based On Cellular Automata
Developments In Ecological Modeling Based On Cellular Automata Abstract Dr Kulbhushan Agnihotri 1 Natasha Sharma 2 * 1. S.B.S. State Technical Campus, Ferozepur, PO box 152004, Punjab, India 2. D.A.V.
More informationComputation in Cellular Automata: A Selected Review
Computation in Cellular Automata: A Selected Review Melanie Mitchell SFI WORKING PAPER: 1996-09-074 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent
More informationA Cellular Automata Approach to Population Modeling
A Cellular Automata Approach to Population Modeling Alexa M. Silverman March 31, 2009 Abstract 1 Introduction 1.1 Cellular automata This project provides an agent-based model of the effects of temperature
More informationONE DIMENSIONAL CELLULAR AUTOMATA(CA). By Bertrand Rurangwa
ONE DIMENSIONAL CELLULAR AUTOMATA(CA). By Bertrand Rurangwa bertrand LUT, 21May2010 Cellula automata(ca) OUTLINE - Introduction. -Short history. -Complex system. -Why to study CA. -One dimensional CA.
More informationRevisiting the Edge of Chaos: Evolving Cellular Automata to Perform. Santa Fe Institute Working Paper (Submitted to Complex Systems)
Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations Melanie Mitchell 1, Peter T. Hraber 1, and James P. Crutcheld 2 Santa Fe Institute Working Paper 93-3-14 (Submitted to Complex
More informationComplex Systems Methods 10. Self-Organized Criticality (SOC)
Complex Systems Methods 10. Self-Organized Criticality (SOC) Eckehard Olbrich e.olbrich@gmx.de http://personal-homepages.mis.mpg.de/olbrich/complex systems.html Potsdam WS 2007/08 Olbrich (Leipzig) 18.01.2007
More informationCellular Automaton Supercomputing
Cellular Automaton Supercomputing 1988 Many of the models now used in science and engineering are over a century old. Most of them can be implemented on modem digital computers only with considerable difficulty.
More informationCS 365 Introduction to Scientific Modeling Fall Semester, 2011 Review
CS 365 Introduction to Scientific Modeling Fall Semester, 2011 Review Topics" What is a model?" Styles of modeling" How do we evaluate models?" Aggregate models vs. individual models." Cellular automata"
More informationExtra! Extra! Critical Update on Life. by Rik Blok. for PWIAS Crisis Points
Extra! Extra! Critical Update on Life by Rik Blok for PWIAS Crisis Points March 18, 1998 40 min. Self-organized Criticality (SOC) critical point: under variation of a control parameter, an order parameter
More informationCBSSS 6/25/02. Physics becomes the. Computing Beyond Silicon Summer School. computer. Norm Margolus
Computing Beyond Silicon Summer School Physics becomes the computer Norm Margolus Physics becomes the computer 0/1 Emulating Physics» Finite-state, locality, invertibility, and conservation laws Physical
More informationWhat are Cellular Automata?
Cellular Automata What are Cellular Automata?! It is a model that can be used to show how the elements of a system interact with each other.! Each element of the system is assigned a cell.! The cells can
More informationCoexistence of Dynamics for Two- Dimensional Cellular Automata
Coexistence of Dynamics for Two- Dimensional Cellular Automata Ricardo Severino Department of Mathematics and Applications University of Minho Campus de Gualtar - 4710-057 Braga, Portugal Maria Joana Soares
More informationA Colorful Introduction to Cellular Automata
A Colorful Introduction to Cellular Automata Silvio Capobianco February 5, 2011 Revised: February 10, 2011 Silvio Capobianco () February 5, 2011 1 / 37 Overview Cellular automata (ca) are local presentations
More informationCellular Automata & Pattern Formation
LASSP Pizza Talk June 13, 2002 Cellular Automata & Pattern Formation Siew-Ann Cheong 1 Prologue Not an advertisement for Wolfram... Not a Wolfite... Rather... P681 Pattern Formation and Spatio-Temporal
More informationEMERGENT 1D ISING BEHAVIOR IN AN ELEMENTARY CELLULAR AUTOMATON MODEL
International Journal of Modern Physics C Vol. 20, No. 1 (2009) 133 145 c World Scientific Publishing Company EMERGENT 1D ISING BEHAVIOR IN AN ELEMENTARY CELLULAR AUTOMATON MODEL PAUL G. KASSEBAUM and
More information@igorwhiletrue
Abstrakte Maschinen @igorwhiletrue Programming is hard Why? Link between our universe and computational universe Cellular automata are self-replicating abstract machines Humans are self-replicating biological
More informationTHE GARDEN-OF-EDEN THEOREM FOR FINITE CONFIGURATIONS
THE GARDEN-OF-EDEN THEOREM FOR FINITE CONFIGURATIONS S. AMOROSO AND G. COOPER Abstract. In [l] Moore showed that the existence of mutually erasable configurations in a two-dimensional tessellation space
More informationOn Elementary and Algebraic Cellular Automata
Chapter On Elementary and Algebraic Cellular Automata Yuriy Gulak Center for Structures in Extreme Environments, Mechanical and Aerospace Engineering, Rutgers University, New Jersey ygulak@jove.rutgers.edu
More informationThe Evolutionary Design of Collective Computation in Cellular Automata
The Evolutionary Design of Collective Computation in Cellular Automata James P. Crutchfield Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 8751 chaos@santafe.edu Melanie Mitchell Santa Fe Institute
More informationTRANSLATING PARTITIONED CELLULAR AUTOMATA INTO CLASSICAL TYPE CELLULAR AUTOMATA VICTOR POUPET
Journées Automates Cellulaires 2008 (Uzès), pp. 130-140 TRANSLATING PARTITIONED CELLULAR AUTOMATA INTO CLASSICAL TYPE CELLULAR AUTOMATA VICTOR POUPET Laboratoire d Informatique Fondamentale (LIF), UMR
More informationBINARY MORPHOLOGY AND CELLULAR AUTOMATA
BINARY MORPHOLOGY AND CELLULAR AUTOMATA I can't leave this subject without mentioning cellular automata (CAs). Conway's "Game of Life" is an example of a cellular automaton (CA). In each generation (or
More informationEvolutionary Games and Computer Simulations
Evolutionary Games and Computer Simulations Bernardo A. Huberman and Natalie S. Glance Dynamics of Computation Group Xerox Palo Alto Research Center Palo Alto, CA 94304 Abstract The prisoner s dilemma
More informationCBSSS 6/24/02. Physics becomes the. Computing Beyond Silicon Summer School. computer. Norm Margolus
Computing Beyond Silicon Summer School Physics becomes the computer Norm Margolus Physics becomes the computer 0/1 Emulating Physics» Finite-state, locality, invertibility, and conservation laws Physical
More informationPartitioning of Cellular Automata Rule Spaces
Partitioning of Cellular Automata Rule Spaces Rodrigo A. Obando TSYS School of Computer Science Columbus State University 4225 University Avenue Columbus, GA 31907, USA Obando_Rodrigo@ColumbusState.edu
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 16 Jan 2004
arxiv:cond-mat/0401302v1 [cond-mat.stat-mech] 16 Jan 2004 Abstract Playing with sandpiles Michael Creutz Brookhaven National Laboratory, Upton, NY 11973, USA The Bak-Tang-Wiesenfeld sandpile model provdes
More informationA Cellular Automata Approach to Population Modeling
A Cellular Automata Approach to Population Modeling Alexa M. Silverman February 24, 2009 Abstract 1 Introduction 1.1 Cellular automata This project provides an agent-based model of the effects of temperature
More informationComplex Interactions in One-dimensional Cellular Automata and Linguistic Constructions
Applied Mathematical Sciences, Vol. 12, 2018, no. 15, 691-721 HIKARI Ltd www.m-hikari.com https://doi.org/10.12988/ams.2018.8353 Complex Interactions in One-dimensional Cellular Automata and Linguistic
More informationFrom Glider to Chaos: A Transitive Subsystem Derived From Glider B of CA Rule 110
From Glider to Chaos: A Transitive Subsystem Derived From Glider B of CA Rule 110 Pingping Liu, Fangyue Chen, Lingxiao Si, and Fang Wang School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang,
More informationCoalescing Cellular Automata
Coalescing Cellular Automata Jean-Baptiste Rouquier 1 and Michel Morvan 1,2 1 ENS Lyon, LIP, 46 allée d Italie, 69364 Lyon, France 2 EHESS and Santa Fe Institute {jean-baptiste.rouquier, michel.morvan}@ens-lyon.fr
More informationIntroduction to Cellular automata
Jean-Philippe Rennard Ph.D. 12/2000 Introduction to Cellular automata There is a wealth of literature about cellular automata, as well as many Internet resources (you'll find some of them in the links
More informationProperties and Behaviours of Fuzzy Cellular Automata
Properties and Behaviours of Fuzzy Cellular Automata Heather Betel Thesis submitted to the Faculty of Graduate and Postdoctoral Studies in partial fulfilment of the requirements for the PhD degree in Electrical
More informationCan You do Maths in a Crowd? Chris Budd
Can You do Maths in a Crowd? Chris Budd Human beings are social animals We usually have to make decisions in the context of interactions with many other individuals Examples Crowds in a sports stadium
More informationarxiv:cond-mat/ v4 [cond-mat.soft] 23 Sep 2002
arxiv:cond-mat/0207679v4 [cond-mat.soft] 23 Sep 2002 A Two-Player Game of Life Mark Levene and George Roussos School of Computer Science and Information Systems Birkbeck College, University of London London
More informationLecture 6: Sequential Dynamical Systems
Math 137B Professor: Padraic Bartlett Lecture 6: Sequential Dynamical Systems Weeks 8-9 UCSB 2014 (Relevant source material: the first four chapters of Mortveit and Reidys s An Introduction to Sequential
More information11. Automata and languages, cellular automata, grammars, L-systems
11. Automata and languages, cellular automata, grammars, L-systems 11.1 Automata and languages Automaton (pl. automata): in computer science, a simple model of a machine or of other systems. ( a simplification
More informationComplex dynamics of elementary cellular automata emerging from chaotic rules
International Journal of Bifurcation and Chaos c World Scientific Publishing Company Complex dynamics of elementary cellular automata emerging from chaotic rules Genaro J. Martínez Instituto de Ciencias
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 20 Jan 1997
arxiv:cond-mat/9701118v1 [cond-mat.stat-mech] 20 Jan 1997 Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness Cristopher Moore Santa Fe Institute 1399 Hyde Park Road, Santa Fe NM 87501
More informationComplex Systems Theory
Complex Systems Theory 1988 Some approaches to the study of complex systems are outlined. They are encompassed by an emerging field of science concerned with the general analysis of complexity. Throughout
More informationDiscrete Tranformation of Output in Cellular Automata
Discrete Tranformation of Output in Cellular Automata Aleksander Lunøe Waage Master of Science in Computer Science Submission date: July 2012 Supervisor: Gunnar Tufte, IDI Norwegian University of Science
More informationDynamical Behavior of Cellular Automata
Dynamical Behavior of Cellular Automata Miles Kenyon and Matthew Driscoll December 4, 2009 1 Introduction Cellular Automata are simple computational models which can be leveraged to model a wide variety
More informationCELLULAR AUTOMATA WITH CHAOTIC RULE FORMATION AND ITS CHARACTERISTICS ABSTRACT
CELLULAR AUTOMATA WITH CHAOTIC RULE FORMATION AND ITS CHARACTERISTICS Christopher Immanuel W * 1 Paul Mary Deborrah S 2 Samuel Selvaraj R 3 * Research and Development Centre, Bharathiar University, Coimbatore
More informationCellular Automata: Overview and classical results
Reykjavík, August 23, 2006 Cellular Automata: Overview and classical results Silvio Capobianco Háskólinn í Reykjavík, Silvio@ru.is Università degli Studi di Roma La Sapienza, capobian@mat.uniroma1.it 1
More information