Modelling with cellular automata

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Modelling with cellular automata"

Transcription

1 Modelling with cellular automata Shan He School for Computational Science University of Birmingham Module : Computational Modelling with MATLAB

2 Outline Outline of Topics Concepts about cellular automata Elementary Cellular Automaton Langton s ant Game of life CA for Lotka-Volterra model Conclusion

3 Concepts about cellular automata What are cellular automata? cellular automaton: a discrete model consists of a regular grid of cells, each in one of a finite number of states, such as On and Off. The grid is usually in 2D, but can be in any finite number of dimensions. The cells evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells. Originated from von Neumann, populated in 70s by John Conway s Game of Life, further researched by Stephen Wolfram Can be seen as the simplest agent-based models

4 Concepts about cellular automata Why CA are important? The best tool to model and study complex system, because: They are simple; The mechanisms are completely known; They can do just about anything They might help us understand our universe: is the universe a cellular automaton? They have lots of applications, e.g., random number generator.

5 Concepts about cellular automata Some CA based biological models Pattern formation in biology, e.g., Conus textile Modelling cell interactions: brain tumor growth.

6 Elementary Cellular Automaton Elementary Cellular Automaton The simplest: One dimensional; Two possible states per cell: 0 and 1 ; A cell s neighbors defined to be the adjacent cells on either side of it. A cell and its two neighbors form a neighborhood of 3 cells: 2 3 = 8 possible patterns for a neighborhood. A rule consists of deciding, for each pattern, whether the cell will be a 1 or a 0 in the next generation: 2 8 = 256 possible rules.

7 Elementary Cellular Automaton Wolfram code Invented by Stephen Wolfram, the inventor of Mathematica and promulgator of cellular automata. Clever idea: Each possible current configuration is written on order, 111, 110,..., 001, 000, and the resulting state for each of these configurations is written in the same order and interpreted as the binary representation of an integer. Summarised as a transition rule table, for example: current pattern new state for center cell We have 2 8 = 256 possible rules, named from rule 1 to rule 255.

8 Elementary Cellular Automaton Question The previous transition table is for rule 100, because the binary number string of decimal number 110 is Using the transition rule table you derived above, show how the following initial configuration of the rule 110 cellular automaton evolves in the next three time steps: Initial configuration

9 Elementary Cellular Automaton Unique rules Many of the 256 rules are trivially equivalent to each other: simple transformation of the underlying geometry: Mirror: reflection through a vertical axis. Complement: exchange the roles of 0 and 1 in the definition. Rule 110: The mirror image is rule 124, the complement is rule 137, and the mirrored complement is rule 193. There are 88 unique rules.

10 Elementary Cellular Automaton Wolfram Classes Class 1: rapidly converge to a uniform state. Examples are rules 0, 32, 160 and 250. Class 2: rapidly converge to a repetitive or stable state. Examples are rules 4, 108, 218 and 232. Class 3: appear to remain in a random state. Examples are rules 22, 30, 126, 150, 182. Class 4: form areas of repetitive or stable states, but also form structures that interact with each other in complicated ways. Local changes to the initial pattern may spread infinitely. An example is rule 110. Rule 110 has been shown to be capable of universal computation.

11 Elementary Cellular Automaton Rule 30 and Chaos Rule 30: Discovered by Stephen Wolfram, his all-time favourite rule. Displays aperiodic, chaotic behaviour. The key to understanding how simple rules produce complex structures and behaviour in nature

12 Elementary Cellular Automaton Rule 110 and Universal Computation Also called universal Turing machine, a machine exhibits universality Universality: the property of being able to perform different tasks with the same underlying construction just by being programmed in a different way. - from Wolfram Mathworld Basically means: in principle, Rule 110 can simulated any calculation or computer program (with even a polynomial overhead!!)

13 Elementary Cellular Automaton Rule 110 and Universal Computation The proof of the universality is complicated: to proof it is capable to emulate cyclic tag system, which is known to be universal. A cyclic tag system: a binary string of finite but unbounded length evolves under the action of production rules applied in cyclic order. Requires an infinite number of localized patterns (binary string) to be embedded self-perpetuating localized patterns as background pattern (production rules) Self-perpetuating localized patterns (spaceships): Example localized patterns: , and 111.

14 Elementary Cellular Automaton Other interesting rules and an interesting article Rule 62: Appears to be class 4 in the beginning but evolves into a repetitive state (class 2). Rule 73: Class 2, a lot of repetitive states separated by walls. But some are not obvious. Rule 54: Class 4 but its capability of universal computation has not been proved. The Simplest Universal Turing Machine Is Proved

15 Langton s ant Langton s ant A very simple 2D CA: very simple rules, but complicated emergent behavior A grid of cells with two possible states per cell: 0 (white) and 1 (black); Two simple rules: At a white cell, turn 90 right, flip the color of the cell, move forward one unit At a black cell, turn 90 left, flip the color of the cell, move forward one unit Complex behaviour: Initial period of chaotic behaviour for about 10,000 steps, then builds a recurrent highway pattern of 104 steps that repeats indefinitely.

16 Langton s ant Extension of Langton s ant Instead of just black and white, more colors can be used. For each of the successive colors, a letter L or R is used to indicate whether a left or right turn should be taken. Example: Black Red Green Blue Black Black: L Red: R Green: L Blue: L Click here to see more example.

17 Game of life Game of life Also know as life. A CA invented by the John Conway in Originally devised on a board for the game of GO. A zero-player game, meaning that its evolution is determined by its initial state. Opened up a whole new field of mathematical research, the field of cellular automata. Also shown to be capable of universal computation.

18 Game of life Game of life Every cell interacts with its eight neighbours (cells are horizontally, vertically, or diagonally adjacent) following the three simple rules: Any live cell with two live neighbours lives on to the next generation. Any cell with exactly three live neighbours becomes or remains a live cell. Any other cell dies.

19 Game of life Game of life Let s try this on a very simple pattern:

20 Game of life Game of life Next step:

21 Game of life Interesting patterns in game of life Period 2 oscillator: Blinker, Toad and Beacon Period 3 oscillator: Pulsar Methuselah patterns: small seed pattern of initial live cells that take a large number of generations in order to stabilize. Spaceships: Glider Patterns grow indefinitely: Gosper glider gun Click here for common patterns in game of life

22 Game of life Other life-like CA rules Notation for rules: Wolfram Code; MCell notation: a string x/y. Digit d {0,..., 8} in the x means that a live cell with d live neighbors survives into the next generation, and the presence of d in the y string means that a dead cell with d live neighbors becomes alive in the next generation. For example: Game of Life can be denoted as 23/3 Golly notation: similar to above, but written in the form By/Sx, e.g., Game of Life can be denoted as B3/S23 Examples: Modern CA Entrance

23 Game of life Advantages of CA modelling approach They are simple and easy to be implemented. The are able to verify the relevance of physical mechanisms. They can include relationships and behaviors which are difficult to formulate as continuum equations. They reflect the intrinsic individuality of cells.

24 Game of life Disadvantages of CA modelling approach Difficult for quantitative simulations. The artificial constraints of grid (lattice discretisation) Difficult to interpret the simulation outcomes

25 CA for Lotka-Volterra model CA for Lotka-Volterra model Pick a site (only stochastic updates allowed), and a neighbour. If fox is adjacent to rabbit, rabbit gets eaten (becomes fox with probability r). Else fox dies with probability p. If rabbit is adjacent to bare ground, reproduces with probability q. If bare ground is adjacent to anything, the thing moves into bare ground.

26 Conclusion Reading and video Complex Systems TED: Computing: a theory of everything

27 Conclusion Take home messages Complex behaviour, e.g., choatic behaviour, emerges from local simple rules. By CA, we have demonstrated the four important characteristics of complex systems: Self-organisation; Non-Linearity; Chaotic behaviour; Emergent Properties. CA can be used to model complex systems, e.g., biological systems. CA are the simplest agent-based models.

28 Conclusion Assignment Write a MATLAB programme to convert patterns on Life Lexicon Home Page for our MATLAB Game of Life (Click here for Life Lexicon Home Page)

biologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

biologically-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 information

Motivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems

Motivation. 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 information

Cellular Automata. Jason Frank Mathematical Institute

Cellular 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 information

Outline 1 Introduction Tiling definitions 2 Conway s Game of Life 3 The Projection Method

Outline 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 information

Cellular Automata: Tutorial

Cellular 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 information

Cellular Automata and Tilings

Cellular 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 information

@igorwhiletrue

@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 information

Elementary Cellular Automata with

Elementary Cellular Automata with letourneau_pdf.nb 1 Elementary Cellular Automata with Memory Paul-Jean Letourneau Department of Physics, University of Calgary Elementary Cellular Automata (ECA) In order to explain how an Elementary Cellular

More information

Complexity Classes in the Two-dimensional Life Cellular Automata Subspace

Complexity 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 information

Shannon Information (very briefly!) Lecture 4. Maximum and Minimum Entropy. Entropy. Entropy of Transition Rules. Entropy Examples

Shannon 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 information

Bio-inspired Models of Computation Seminar. Daniele Sgandurra. 16 October 2009

Bio-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 information

Phenomenon: Canadian lynx and snowshoe hares

Phenomenon: Canadian lynx and snowshoe hares Outline Outline of Topics Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Phenomenon: Canadian lynx and snowshoe hares All began with

More information

XX Eesti Arvutiteaduse Talvekool

XX 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 information

Elementary cellular automata

Elementary 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 information

Complex Systems Theory

Complex 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 information

Computation in Cellular Automata: A Selected Review

Computation 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 information

Introduction to Cellular automata

Introduction 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 information

Properties and Behaviours of Fuzzy Cellular Automata

Properties 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 information

Artificial Life. Prof. Dr. Rolf Pfeifer Hanspeter Kunz Marion M. Weber Dale Thomas. Institut für Informatik der Universität Zürich

Artificial Life. Prof. Dr. Rolf Pfeifer Hanspeter Kunz Marion M. Weber Dale Thomas. Institut für Informatik der Universität Zürich Artificial Life Prof. Dr. Rolf Pfeifer Hanspeter Kunz Marion M. Weber Dale Thomas Institut für Informatik der Universität Zürich 26. Juni 2001 Contents i Contents Chapter 1: Introduction 1.1 Historical

More information

Modelling biological oscillations

Modelling biological oscillations Modelling biological oscillations Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Van der Pol equation Van

More information

Cellular automata as emergent systems and models of physical behavior

Cellular automata as emergent systems and models of physical behavior Cellular automata as emergent systems and models of physical behavior Jason Merritt December 19, 2012 Abstract Cellular automata provide a basic model for complex systems generated by simplistic rulesets.

More information

Two-Dimensional Automata

Two-Dimensional Automata Chapter 4 Two-Dimensional Automata The chessboard is the world, the pieces are the phenomena of the universe, the rules of the game are what we call the laws of Nature. Thomas Henry Huxley Two-dimensional

More information

Logic Programming for Cellular Automata

Logic Programming for Cellular Automata Technical Communications of ICLP 2015. Copyright with the Authors. 1 Logic Programming for Cellular Automata Marcus Völker RWTH Aachen University Thomashofstraße 5, 52070 Aachen, Germany (e-mail: marcus.voelker@rwth-aachen.de)

More information

Project 1: Edge of Chaos in 1D Cellular Automata

Project 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 information

Cellular Automata. Introduction

Cellular Automata. Introduction Cellular Automata 1983 Introduction It appears that the basic laws of physics relevant to everyday phenomena are now known. Yet there are many everyday natural systems whose complex structure and behavior

More information

Cellular Automata as Models of Complexity

Cellular Automata as Models of Complexity Cellular Automata as Models of Complexity Stephen Wolfram, Nature 311 (5985): 419 424, 1984 Natural systems from snowflakes to mollusc shells show a great diversity of complex patterns. The origins of

More information

Simulation of cell-like self-replication phenomenon in a two-dimensional hybrid cellular automata model

Simulation of cell-like self-replication phenomenon in a two-dimensional hybrid cellular automata model Simulation of cell-like self-replication phenomenon in a two-dimensional hybrid cellular automata model Takeshi Ishida Nippon Institute of Technology ishida06@ecoinfo.jp Abstract An understanding of the

More information

EMERGENT 1D ISING BEHAVIOR IN AN ELEMENTARY CELLULAR AUTOMATON MODEL

EMERGENT 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

Universality in Elementary Cellular Automata

Universality in Elementary Cellular Automata Universality in Elementary Cellular Automata Matthew Cook Department of Computation and Neural Systems, Caltech, Mail Stop 136-93, Pasadena, California 91125, USA The purpose of this paper is to prove

More information

Larger than Life: Digital Creatures in a Family of Two-Dimensional Cellular Automata

Larger than Life: Digital Creatures in a Family of Two-Dimensional Cellular Automata Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 177 192 Larger than Life: Digital Creatures in a Family of Two-Dimensional Cellular Automata Kellie Michele Evans California

More information

Data. analysis RISK SECRET CONSUME RISK INFORMATION LEAD DESIGN UNITED FOLLOW BUSINESS EXPAND MEDIA VIDEO VIDEO UNITED CONSUME WORLD NETWORK MIRROR

Data. analysis RISK SECRET CONSUME RISK INFORMATION LEAD DESIGN UNITED FOLLOW BUSINESS EXPAND MEDIA VIDEO VIDEO UNITED CONSUME WORLD NETWORK MIRROR Data VIDEO analysis TEXT RISK APPLICATION SPEED INTERNET DATA INFORMATION CONSUME BUSINESS CAPITAL RESOURCE VIDEO MEDIA ECONOMIC DIVERSE YES NO TRAINING TOWER COMMERCIAL LEAD FOLLOW DESIGN IMPROVE FACT

More information

From 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 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 information

Learning Cellular Automaton Dynamics with Neural Networks

Learning 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 information

The Structure of the Elementary Cellular Automata Rule Space

The Structure of the Elementary Cellular Automata Rule Space The Structure of the Elementary Cellular Automata Rule Space Wentian Li Santa Fe Institute, 1120 Canyon Road, Santa Fe, NM 87501, USA Norman Packard Center for Complex Systems Research, Physics Department,

More information

Sorting Network Development Using Cellular Automata

Sorting Network Development Using Cellular Automata Sorting Network Development Using Cellular Automata Michal Bidlo, Zdenek Vasicek, and Karel Slany Brno University of Technology, Faculty of Information Technology Božetěchova 2, 61266 Brno, Czech republic

More information

Chaotic Subsystem Come From Glider E 3 of CA Rule 110

Chaotic 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 information

PS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010

PS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010 University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,

More information

ONE DIMENSIONAL CELLULAR AUTOMATA(CA). By Bertrand Rurangwa

ONE 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 information

Quantum Cellular Automata (QCA) Andrew Valesky

Quantum Cellular Automata (QCA) Andrew Valesky Quantum Cellular Automata (QCA) Andrew Valesky Presentation Schedule Quantum Observations (5 min) Cellular Automata (5 min) Quantum Cellular Automata (10 min) Pythagoras of Samos Pythagorean Theorem Pythagoreanism

More information

Pascal s Triangle: Cellular Automata and Attractors

Pascal s Triangle: Cellular Automata and Attractors Chapter 8 Pascal s Triangle: Cellular Automata and Attractors Mathematics is often defined as the science of space and number [...] It was not until the recent resonance of computers and mathematics that

More information

Lab 5: Nonlinear Systems

Lab 5: Nonlinear Systems Lab 5: Nonlinear Systems Goals In this lab you will use the pplane6 program to study two nonlinear systems by direct numerical simulation. The first model, from population biology, displays interesting

More information

2 - Strings and Binomial Coefficients

2 - Strings and Binomial Coefficients November 14, 2017 2 - Strings and Binomial Coefficients William T. Trotter trotter@math.gatech.edu Basic Definition Let n be a positive integer and let [n] = {1, 2,, n}. A sequence of length n such as

More information

Discrete chaos in everyday life

Discrete chaos in everyday life Discrete chaos in everyday life Krzysztof Kułakowski, Piotr Gronek, Antoni Dydejczyk Faculty of Physics and Applied Computer Science AGH University of Science and Technology Complex Systems Group ESSA

More information

Variations on Conway s Game of Life and Other Cellular Automata. David Hua and Martin Pelikan

Variations on Conway s Game of Life and Other Cellular Automata. David Hua and Martin Pelikan Variations on Conway s Game of Life and Other Cellular Automata David Hua and Martin Pelikan Research Paper Presented to the Students and Teachers as Research Scientists Program at the University of Missouri-St.

More information

Cell-based Model For GIS Generalization

Cell-based Model For GIS Generalization Cell-based Model For GIS Generalization Bo Li, Graeme G. Wilkinson & Souheil Khaddaj School of Computing & Information Systems Kingston University Penrhyn Road, Kingston upon Thames Surrey, KT1 2EE UK

More information

Before we show how languages can be proven not regular, first, how would we show a language is regular?

Before we show how languages can be proven not regular, first, how would we show a language is regular? CS35 Proving Languages not to be Regular Before we show how languages can be proven not regular, first, how would we show a language is regular? Although regular languages and automata are quite powerful

More information

Received: 21 July 2017; Accepted: 1 November 2017; Published: 24 November 2017

Received: 21 July 2017; Accepted: 1 November 2017; Published: 24 November 2017 entropy Article Analyzing Information Distribution in Complex Systems Sten Sootla, Dirk Oliver Theis and Raul Vicente * Institute of Computer Science, University of Tartu, Ulikooli 17, 50090 Tartu, Estonia;

More information

Lecture 24: Randomized Complexity, Course Summary

Lecture 24: Randomized Complexity, Course Summary 6.045 Lecture 24: Randomized Complexity, Course Summary 1 1/4 1/16 1/4 1/4 1/32 1/16 1/32 Probabilistic TMs 1/16 A probabilistic TM M is a nondeterministic TM where: Each nondeterministic step is called

More information

Computability Theory

Computability Theory Computability Theory Cristian S. Calude May 2012 Computability Theory 1 / 1 Bibliography M. Sipser. Introduction to the Theory of Computation, PWS 1997. (textbook) Computability Theory 2 / 1 Supplementary

More information

Asynchronous random Boolean network model based on elementary cellular automata

Asynchronous random Boolean network model based on elementary cellular automata Asynchronous random Boolean networ model based on elementary cellular automata Mihaela T. Matache* Jac Heidel Department of Mathematics University of Nebrasa at Omaha Omaha, NE 6882-243, USA *dmatache@mail.unomaha.edu

More information

biologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

biologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing lecture 6 -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 information

Ian Stewart's article "Million-Dollar Minesweeper"

Ian Stewart's article Million-Dollar Minesweeper Page 1 of 5 Million-Dollar Minesweeper Lecture: November 1, 2000 (Video Online) Ian Stewart, Department of Mathematics, University of Warwick, UK It's not often you can win a million dollars by analysing

More information

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. ) Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson

More information

CS 361 Meeting 26 11/10/17

CS 361 Meeting 26 11/10/17 CS 361 Meeting 26 11/10/17 1. Homework 8 due Announcements A Recognizable, but Undecidable Language 1. Last class, I presented a brief, somewhat inscrutable proof that the language A BT M = { M w M is

More information

Controlling chaos in random Boolean networks

Controlling chaos in random Boolean networks EUROPHYSICS LETTERS 20 March 1997 Europhys. Lett., 37 (9), pp. 597-602 (1997) Controlling chaos in random Boolean networks B. Luque and R. V. Solé Complex Systems Research Group, Departament de Fisica

More information

Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography Sambhu Prasad Panda 1, Madhusmita Sahu 2, Manas Kumar Swain 3 C V Raman Computer Academy 1,2, C V Raman College

More information

Investigations of Game of Life Cellular Automata rules on Penrose Tilings: lifetime, ash, and oscillator statistics

Investigations of Game of Life Cellular Automata rules on Penrose Tilings: lifetime, ash, and oscillator statistics Investigations of Game of Life Cellular Automata rules on Penrose Tilings: lifetime, ash, and oscillator statistics Nick Owens, Susan Stepney 2 Department of Electronics, University of York, UK 2 Department

More information

CSC 4510 Machine Learning

CSC 4510 Machine Learning 10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on

More information

arxiv: v4 [cs.dm] 20 Nov 2017

arxiv: v4 [cs.dm] 20 Nov 2017 THE SPREAD OF COOPERATIVE STRATEGIES ON GRIDS WITH RANDOM ASYNCHRONOUS UPDATING CHRISTOPHER DUFFY 1 AND JEANNETTE JANSSEN 2 1 DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF SASKATCHEWAN 2 DEPARTMENT

More information

A survey of the use of cellular automata and cellular automata-like models for simulating a population of biological cells

A survey of the use of cellular automata and cellular automata-like models for simulating a population of biological cells Graduate Theses and Dissertations Graduate College 2011 A survey of the use of cellular automata and cellular automata-like models for simulating a population of biological cells Jeremy D. Knutson Iowa

More information

Turing Machines COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017

Turing Machines COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017 Turing Machines COMP1600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2017 Catch Up / Drop in Lab When Fridays, 15.00-17.00 Where N335, CSIT Building (bldg 108) Until the end of

More information

DISCRETE STRUCTURES FINAL EXAM FALL 2005, SECTION 0201 (PICKETT)

DISCRETE STRUCTURES FINAL EXAM FALL 2005, SECTION 0201 (PICKETT) DISCRETE STRUCTURES FINAL EXAM FALL 2005, SECTION 0201 (PICKETT) NAME: This exam is worth 20% of your final grade (500/2500 points) There are 7 problems (and 1 BONUS problem) You have until 12:30 to finish

More information

Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work

Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 8751 mm@santafe.edu James P. Crutchfield 1 Santa Fe Institute

More information

Evolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia)

Evolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) Evolutionary Computation DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) andrea.roli@unibo.it Evolutionary Computation Inspiring principle: theory of natural selection Species face

More information

Power Spectral Analysis of Elementary Cellular Automata

Power Spectral Analysis of Elementary Cellular Automata Power Spectral Analysis o Elementary Cellular Automata Shigeru Ninagawa Division o Inormation and Computer Science, Kanazawa Institute o Technology, 7- Ohgigaoka, Nonoichi, Ishikawa 92-850, Japan Spectral

More information

Revisiting 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. 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 information

ANDREW WUENSCHE Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico USA,

ANDREW WUENSCHE Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico USA, Classifying Cellular Automata Automatically: Finding Gliders, Filtering, and Relating Space-Time Patterns, Attractor Basins, and the Z Parameter ANDREW WUENSCHE Santa Fe Institute, 1399 Hyde Park Road,

More information

The Power of Extra Analog Neuron. Institute of Computer Science Academy of Sciences of the Czech Republic

The Power of Extra Analog Neuron. Institute of Computer Science Academy of Sciences of the Czech Republic The Power of Extra Analog Neuron Jiří Šíma Institute of Computer Science Academy of Sciences of the Czech Republic (Artificial) Neural Networks (NNs) 1. mathematical models of biological neural networks

More information

CS 125 Section #10 (Un)decidability and Probability November 1, 2016

CS 125 Section #10 (Un)decidability and Probability November 1, 2016 CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping

More information

Computational Mechanics of the Two Dimensional BTW Model

Computational Mechanics of the Two Dimensional BTW Model Computational Mechanics of the Two Dimensional BTW Model Rajesh Kommu kommu@physics.ucdavis.edu June 8, 2010 Abstract Some aspects of computational mechanics in two dimensions are investigated in this

More information

CS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash

CS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash CS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash Equilibrium Price of Stability Coping With NP-Hardness

More information

Solving Linear Equations (in one variable)

Solving Linear Equations (in one variable) Solving Linear Equations (in one variable) In Chapter of my Elementary Algebra text you are introduced to solving linear equations. The main idea presented throughout Sections.1. is that you need to isolate

More information

Theory of Self-Reproducing Automata John Von Neumann. Joshua Ridens and David Shubsda

Theory of Self-Reproducing Automata John Von Neumann. Joshua Ridens and David Shubsda Theory of Self-Reproducing Automata John Von Neumann Joshua Ridens and David Shubsda Natural Automata vs. Artificial Automata Specifically Von Neumann looked at the nervous system and a vacuum tube computer

More information

What is the Q in QRNG?

What is the Q in QRNG? What is the Q in QRNG? IN ORDER TO GUARANTEE ABSOLUTELY RANDOM NUMBERS, RNGS (RANDOM NUMBER GENERATORS) MUST NOT BE VULNERABLE TO PREDICTION OR BIAS, AND THUS DICTATED BY TRUE RANDOMNESS. BUT HOW CAN WE

More information

(Feed-Forward) Neural Networks Dr. Hajira Jabeen, Prof. Jens Lehmann

(Feed-Forward) Neural Networks Dr. Hajira Jabeen, Prof. Jens Lehmann (Feed-Forward) Neural Networks 2016-12-06 Dr. Hajira Jabeen, Prof. Jens Lehmann Outline In the previous lectures we have learned about tensors and factorization methods. RESCAL is a bilinear model for

More information

Quantitative Understanding in Biology Module III: Linear Difference Equations Lecture II: Complex Eigenvalues

Quantitative Understanding in Biology Module III: Linear Difference Equations Lecture II: Complex Eigenvalues Quantitative Understanding in Biology Module III: Linear Difference Equations Lecture II: Complex Eigenvalues Introduction In the previous section, we considered the generalized twovariable system of linear

More information

Graded Project #1. Part 1. Explicit Runge Kutta methods. Goals Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo

Graded Project #1. Part 1. Explicit Runge Kutta methods. Goals Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo 2008-11-07 Graded Project #1 Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo This homework is due to be handed in on Wednesday 12 November 2008 before 13:00 in the post box of the numerical

More information

CISC 876: Kolmogorov Complexity

CISC 876: Kolmogorov Complexity March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline

More information

6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch

6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch 6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch Today Probabilistic Turing Machines and Probabilistic Time Complexity Classes Now add a new capability to standard TMs: random

More information

Before We Start. The Pumping Lemma. Languages. Context Free Languages. Plan for today. Now our picture looks like. Any questions?

Before We Start. The Pumping Lemma. Languages. Context Free Languages. Plan for today. Now our picture looks like. Any questions? Before We Start The Pumping Lemma Any questions? The Lemma & Decision/ Languages Future Exam Question What is a language? What is a class of languages? Context Free Languages Context Free Languages(CFL)

More information

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices We will now switch gears and focus on a branch of mathematics known as linear algebra. There are a few notes worth making before

More information

arxiv:physics/ v1 [physics.soc-ph] 12 Sep 2005

arxiv:physics/ v1 [physics.soc-ph] 12 Sep 2005 arxiv:physics/0509082v1 [physics.soc-ph] 12 Sep 2005 Cellular Automata Models of Road Traffic Accepted for publication in Physics Reports A high-quality version of this paper can be found at http://phdsven.dyns.cx

More information

Systems Biology Across Scales: A Personal View XXIII. Spatial Patterns in Biology: Turing mechanism. Sitabhra Sinha IMSc Chennai

Systems Biology Across Scales: A Personal View XXIII. Spatial Patterns in Biology: Turing mechanism. Sitabhra Sinha IMSc Chennai Systems Biology Across Scales: A Personal View XXIII. Spatial Patterns in Biology: Turing mechanism Sitabhra Sinha IMSc Chennai The magnificent patterns of Dr Turing Question: How to explain the development

More information

Information in Biology

Information in Biology Information in Biology CRI - Centre de Recherches Interdisciplinaires, Paris May 2012 Information processing is an essential part of Life. Thinking about it in quantitative terms may is useful. 1 Living

More information

Turing machines and linear bounded automata

Turing machines and linear bounded automata and linear bounded automata Informatics 2A: Lecture 29 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 25 November, 2011 1 / 13 1 The Chomsky hierarchy: summary 2 3 4 2 / 13

More information

A Phase Diagram for Elementary Cellular Automata

A Phase Diagram for Elementary Cellular Automata Complex Systems 7 (1993) 241-247 A Phase Diagram for Elementary Cellular Automata P.-M. Binder IIASA, A-2361 Laxenburg, A ustria Abstract. We construct a phase diagram for the possible dynamics of one-dimensional,

More information

Kleene Algebras and Algebraic Path Problems

Kleene Algebras and Algebraic Path Problems Kleene Algebras and Algebraic Path Problems Davis Foote May 8, 015 1 Regular Languages 1.1 Deterministic Finite Automata A deterministic finite automaton (DFA) is a model of computation that can simulate

More information

DRAFT. Diagonalization. Chapter 4

DRAFT. Diagonalization. Chapter 4 Chapter 4 Diagonalization..the relativized P =?NP question has a positive answer for some oracles and a negative answer for other oracles. We feel that this is further evidence of the difficulty of the

More information

ECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3

ECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3 ECE 512 Digital System Testing and Design for Testability Model Solutions for Assignment #3 14.1) In a fault-free instance of the circuit in Fig. 14.15, holding the input low for two clock cycles should

More information

Notes for Comp 497 (Comp 454) Week 12 4/19/05. Today we look at some variations on machines we have already seen. Chapter 21

Notes for Comp 497 (Comp 454) Week 12 4/19/05. Today we look at some variations on machines we have already seen. Chapter 21 Notes for Comp 497 (Comp 454) Week 12 4/19/05 Today we look at some variations on machines we have already seen. Errata (Chapter 21): None known Chapter 21 So far we have seen the equivalence of Post Machines

More information

SP-CNN: A Scalable and Programmable CNN-based Accelerator. Dilan Manatunga Dr. Hyesoon Kim Dr. Saibal Mukhopadhyay

SP-CNN: A Scalable and Programmable CNN-based Accelerator. Dilan Manatunga Dr. Hyesoon Kim Dr. Saibal Mukhopadhyay SP-CNN: A Scalable and Programmable CNN-based Accelerator Dilan Manatunga Dr. Hyesoon Kim Dr. Saibal Mukhopadhyay Motivation Power is a first-order design constraint, especially for embedded devices. Certain

More information

The logistic difference equation and the route to chaotic behaviour

The logistic difference equation and the route to chaotic behaviour The logistic difference equation and the route to chaotic behaviour Level 1 module in Modelling course in population and evolutionary biology (701-1418-00) Module author: Sebastian Bonhoeffer Course director:

More information

Fooling Sets and. Lecture 5

Fooling Sets and. Lecture 5 Fooling Sets and Introduction to Nondeterministic Finite Automata Lecture 5 Proving that a language is not regular Given a language, we saw how to prove it is regular (union, intersection, concatenation,

More information

Lecture 22: PSPACE

Lecture 22: PSPACE 6.045 Lecture 22: PSPACE 1 VOTE VOTE VOTE For your favorite course on automata and complexity Please complete the online subject evaluation for 6.045 2 Final Exam Information Who: You On What: Everything

More information

arxiv: v1 [cond-mat.stat-mech] 3 Jul 2014

arxiv: v1 [cond-mat.stat-mech] 3 Jul 2014 Conway s game of life is a near-critical metastable state in the multiverse of cellular automata Sandro M. Reia 1 and Osame Kinouchi 1 arxiv:1407.1006v1 [cond-mat.stat-mech] 3 Jul 2014 1 Faculdade de Filosofia,

More information

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary An Algebra on Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing Spring, 2018 Alice E. Fischer... 1/37 An Algebra on 1 Definitions and Notation Venn Diagrams 2 An Algebra on 3 Alice E. Fischer...

More information

Lecture 23: More PSPACE-Complete, Randomized Complexity

Lecture 23: More PSPACE-Complete, Randomized Complexity 6.045 Lecture 23: More PSPACE-Complete, Randomized Complexity 1 Final Exam Information Who: You On What: Everything through PSPACE (today) With What: One sheet (double-sided) of notes are allowed When:

More information

Introduction to Algorithms

Introduction to Algorithms Lecture 1 Introduction to Algorithms 1.1 Overview The purpose of this lecture is to give a brief overview of the topic of Algorithms and the kind of thinking it involves: why we focus on the subjects that

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,

More information

Linear Programming: Simplex

Linear Programming: Simplex Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016

More information