Cellular Automata: Overview and classical results
|
|
- Aubrey Hutchinson
- 5 years ago
- Views:
Transcription
1 Reykjavík, August 23, 2006 Cellular Automata: Overview and classical results Silvio Capobianco Háskólinn í Reykjavík, Università degli Studi di Roma La Sapienza, 1
2 Introduction Cellular automata are descriptions of global dynamics in terms of local transformations, applied at all points at the same time. By their own nature, they are easy to implement on a computer, and useful as tools for qualitative analysis of dynamical systems. Their properties are also a very vast research field. 2
3 Applications of cellular automata Population dynamics. Economics. Fluid dynamics. Simulations of geological phenomena. Symbolic dynamics. Approximation of differential equations. Screen savers. And much more... 3
4 Literature E. F. Moore, Machine models of self-reproduction, Proc. Symp. Appl. Math. 14 (1962), J. Myhill, The converse of Moore s Garden-of-Eden theorem, Proc. Am. Math. Soc. 14 (1962), G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Math. Syst. Th. 3 (1969), D. Richardson, Tessellations with local transformations, J Comp. Syst. Sci. 6 (1972), S. Amoroso, Y. N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, J. Comp. Syst. Sci. 6 (1972), J. Kari, Reversibility of 2D cellular automata is undecidable, Physica D 45 (1990),
5 History von Neumann, 1950s: mechanical model of self-reproduction Moore, 1962: the Garden of Eden problem Hedlund, 1969: shift dynamical system Richardson, 1972: d-dimensional cellular automata Hardy, de Pazzis, Pomeau 1976: lattice gas cellular automata Amoroso and Patt, 1972; Kari, 1990: the invertibility problem 5
6 The original form John von Neumann s model of self reproduction, 1950s An infinite square grid A finite number of states for each point of the grid A finite number of neighbors for each point of the grid An evolution law where the next state of each point only depends on the current states of its neighbors 6
7 The importance of playing in life The Game of Life was ideated by John Horton Conway in the Sixties, and popularized by Martin Gardner the decade after. The checkboard is an infinite square grid. Each case of the checkboard is surrounded by those within a chess king s move, and can be living or dead. A dead case surrounded by exactly three living case, becomes living. A living case surrounded by two or three living cases, survives. A living case surrounded by less than two living cases, dies of isolation. A living case surrounded by more than three living cases, dies of overpopulation. 7
8 Simple rule, complex behavior The structures of the Game of Life can exhibit a wide range of behaviors. This is a glider, which repeats itself every four iterations, after having moved: Gliders can be used to transmit information between regions of the checkboard. Actually, using gliders and other complex structures, any planar circuit can be simulated inside the Game of Life. 8
9 On a more funny side, this is called the Cheshire cat: 9
10 ... because it vanishes... 10
11 ... and vanishes... 11
12 ... and vanishes... 12
13 ... more... 13
14 ... and more... 14
15 ... until the smile alone cheers at us... 15
16 ... and at last, only a pawprint remains to tell it was there! 16
17 The ingredients of a classical recipe A cellular automaton is a quadruple A = d, Q, N, f where: d > 0 is an integer dimension; Q = {q 1,...,q n } is a finite set set of states; N = {n 1,...,n k } is a finite subset of Z d neighborhood index; f : Q N Q is a function local evolution function. Special neighborhood indexes are: the von Neumann neighborhood vn = {x Z d : d i=1 x i 1}; the Moore neighborhood M = {x Z d : max 1 i d x i 1}. 17
18 This is von Neumann s neighborhood... 18
19 and this is Moore s neighborhood, in dimension d = 2. 19
20 Examples of cellular automata 1 Put: d = 1; Q = {0, 1}; N = vn, the von Neumann neighborhood; f(α 1, α 0, α 1 ) = α 1 xorα 1. This is called Wolfram s rule 90, and its evolution from a single point is... 20
21 ... Pascal s triangle, modulo 2. 21
22 Examples of cellular automata 2 Put: d = 2; Q = {0, 1}; N = M, the Moore neighborhood; 1 if x M\{0} α x = 3, f(α) = 1 if x M\{0} α x = 2 and α 0 = 1, 0 otherwise. This is Conway s Game of Life. 22
23 From local to global An element of Q Zd is called a configuration. The value of c Q Zd at x Z d is indicated as c x or c(x). A pattern is a chunk of configuration having finite size. The map F A : Q Zd Q Zd defined by (F A (c)) x = f(c x+n1,...,c x+nk ) is the global evolution function. 23
24 Finite configurations A state q is stable if it satisfies f(q,...,q) = q If A has one or more stable states, then one of them is chosen once and for all, indicated as q 0, and called the quiescent state. A configuration is finite if only a finite number of cells are nonquiescent. If c is finite, then F A (c) is finite as well. 24
25 Implementations Given their distinctive features, cellular automata rules are easy to implement on a computer. More difficult is to provide a general framework for cellular automata. Hardware CAM6 (Toffoli and Margolus, ca. 1985; expansion card for PC) CAM8 (Toffoli and Margolus, ca. 1990; external device for SparcStation) Software JCASim (Weimar; in Java) SIMP (Bach and Toffoli; in Python) These framework often work on a torus instead of the full plane. 25
26 Cellular automata and Turing machines Let T be a Turing machine with alphabet Σ and set of states. Then 1. put d = 1, 2. put Q = Σ ( {no head}), 3. put N = { 1, 0, 1}, and 4. construct f so that it reproduces the write operation of T on the first component, and the state update of T and the movement of T s head on the right component. Then A = d, Q, N, f simulates T, so that 1-dimensional cellular automata are capable of universal computation 26
27 Associate dynamics A dynamical system is a pair (X, Φ) where X is a compact metrizable space phase space, and Φ is a continuous function from X to X transition function. Observe that Q Zd, with the product topology, is compact by Tychonoff s Theorem. Moreover, putting (x 1,...,x d ) = max{ x 1,..., x d } the product topology is induced by the distance d(c 1, c 2 ) = 2 min{ x (c 1) x (c 2 ) x } i.e., near means equal on a large neighborhood of the origin. 27
28 Theorem (Hedlund, 1969) Let F : Q Zd Q Zd. The following are equivalent: 1. F is the global evolution function of a cellular automaton; 2. F is continuous in the product topology, and commutes with the translations, i.e., the transformations of Q Zd of the form c x (y) = c(x + y) y Z d Let A = d, Q, N, f be a cellular automaton. ) (Q Zd, F A By Hedlund s Theorem, is a dynamical system associate to A. We can thus say that a cellular automaton has a property, e.g., injectivity or surjectivity or chaoticity, if its associate dynamical system does. 28
29 Classification of cellular automata One-dimensional cellular automata were extensively studied by Stephen Wolfram. His work was both pioneering and influential. Among other things, he suggested the following, empirical classification: 1. evolution leads to homogenous state; 2. evolution leads to periodic structures; 3. evolution leads to chaotic space-time patterns; 4. evolution leads to complex localized structures. Wolfram s classification is much an appeal to common sense and cannot, for example, identify universal computation. A formalization was suggested by Culik and Yu and proved to be undecidable. 29
30 A way of labeling cellular automata rules also takes Wolfram s name. Given a 1-dimensional, 2-state rule with von Neumann neighborhood, 1. identify the sequence (α 1, α 0, α 1 ) with the the binary number α 1 α 0 α 1, and 2. associate to the rule f the number 7 j=0 2j f(j). This is called Wolfram s number of the rule f. Exercise: compute Wolfram s number for f(α 1, α 0, α 1 ) = α 1 xorα 1. Hint: α α α f(α 1, α 0, α 1 )
31 One after another Composition is well defined for cellular automata of same dimension and set of states. 1. Suppose A j = d, Q, N j, f j for j = 1, 2 are given. 2. Set N = {x Z d x 1 N 1, x 2 N 2 x = x 1 + x 2 }. 3. Define f : Q N Q as ( f(α) = f 2...,f1 (...,α n1,i +n 2,j,...,),... ) Then A = d, Q, N, f satisfies F A = F A2 F A1. In particular, the class of cellular automata with given dimension and set of states is a semigroup (monoid) under composition. 31
32 Reversibility A cellular automaton A is reversible if 1. A is invertible, and 2. F 1 A is the global evolution function of some CA. Equivalently, A is reversible if there exists a cellular automaton A such that both A A and A A are the identity cellular automaton. This seems more than just existence of inverse global evolution function. Reversible cellular automata are important because Physics, at microscopical scale, is itself reversible. 32
33 Theorem (Hedlund, 1969; Richardson, 1972 in a broader context) The following are equivalent: 1. A is reversible; 2. A is invertible. In other words: existence of inverse cellular automaton comes at no cost from existence of inverse evolution. In particular, the class of reversible cellular automata with given dimension and set of states is a group under composition. 33
34 Theorem (Toffoli, 1977) Every d-dimensional cellular automaton can be simulated by a (d + 1)-dimensional reversible cellular automaton. Corollary: reversible cellular automata are capable of universal computation. Theorem (Morita and Harao, 1989) Reversible Turing machines can be simulated by 1-dimensional reversible cellular automata. Corollary: there exist 1-dimensional reversible cellular automata that are computationally universal. 34
35 Gardens of Eden Let A = d, Q, N, f be a cellular automaton. A Garden of Eden (GoE) configuration for A is a configuration c such that F A (c ) c for all c ; i.e., it can be lost, but not regained. A Garden of Eden (GoE) pattern for A is a pattern that can only appear in GoE configurations for A. Lemma The following are equivalent: 1. A has a GoE configuration; 2. A has a GoE pattern. Corollary: determining whether a cellular automaton is surjective, is co-r.e. 35
36 Corollary: Conway s Game of Life is not surjective. Proof: The following pattern is a GoE for Conway s Game of Life: Try it! 36
37 Preinjectivity A cellular automaton A is preinjective if it satisfies the following condition: for any two c 1, c 2 Q Zd, if {x Z d c 1 (x) c 2 (x)} is finite and nonempty, then F A (c 1 ) F A (c 2 ). This is a condition weaker than injectivity. If A has a quiescent state, this is the same as saying that A is injective on finite configurations 37
38 Cellular automata are not finite, but almost. Equivalent of surjectivity for cellular automata should be not injectivity, but almost. Theorem (Moore, 1962) If A is surjective, then it is preinjective. Theorem (Myhill, 1962) If A is preinjective, then it is surjective. 38
39 Corollary: if A is injective, then it is also surjective. (This is sometimes called Richardson s Lemma as well.) As a consequence, if we call CA the class of cellular automata, RCA the class of reversible cellular automata, PSCA the class of surjective, noninjective cellular automata, NCA the class of nonsurjective, noninjective cellular automata then we have CA = RCA PSCA NCA 39
40 An element of the class PSCA Wolfram s rule 90 is not injective. In fact, if c 0 (x) = 0 x Z ; c 1 (x) = 1 x Z then F 90 (c 0 ) = F 90 (c 1 ) = c 0. On the other hand, Wolfram s rule 90 is surjective. In fact, 1. for every a and k, the equation a xorx = k has a unique solution, and 2. for every b and k, the equation xxorb = k has a unique solution. Thus every configuration has exactly four predecessors for Wolfram s rule 90. (Can you see why?) 40
41 The invertibility problem Let C be a class of cellular automata. The invertibility problem for C states: given an element A of C, determine whether F A is invertible Saying that the invertibility problem for C is decidable, means that there exists an algorithm capable of stating the invertibility of the global dynamics described by an arbitrary element of C, only by looking at its local description. Thus, decidability of the invertibility problem is a strong requirement. 41
42 Let d-dca be the class of d-dimensional cellular automata. Theorem (Amoroso and Patt, 1972) The invertibility problem for 1-DCA is decidable. The proof of this result is somewhat complex, as Amoroso and Patt s algorithm checks, in the order: 1. whether A is surjective; 2. whether each state has the same number of preimages under f ; 3. whether A is injective and it is known that point 3 implies points 1 and 2. 42
43 Amoroso and Patt asked whether their techniques could be extended to greater dimensions. Theorem (Kari, 1990) The invertibility problem for 2-DCA is undecidable. Corollary: The invertibility problem for d-dca is undecidable for all d 2. Kari s proof involves a reduction from Hao Wang s Tiling Problem: given a collection of square tiles with colored edges, determine whether it can tile the whole plane so that adjacent edges always are the same color and it is known that is undecidable (Berger, 1966). 43
44 Lattice gases Structures on regular lattices, whose updating function is made of a propagation phase, with particles moving along the edges, and a collision phase, with particles interacting inside nodes. Origin: Fluid dynamics. Aim: approximate Navier-Stokes equations. 44
45 Example of lattice gas 1 HPP (Hardy, de Pazzis, Pomeau; 1976) Square grid. Up to four particles per cell. Collision rule: if exactly two particles coming from opposite directions: rotate of a right angle; else: proceed along original path. Pros: can reproduce macroscopical behavior. Cons: introduces spurious invariants. 45
46 Example of lattice gas 2 FHP (Frisch, Hasslacher, Pomeau; 1986) Triangular grid. Up to six particles per site. Probabilistic collision rule. FHP is immune to most of HPP s pathologies. 46
47 Cellular automata and lattice gases Every lattice gas is a cellular automaton. The invertibility problem for lattice gases is decidable. Every cellular automaton can be simulated by a lattice gas. Actually, this is was done in CAM8 and in SIMP until very recently. Not every cellular automaton can be rewritten as a lattice gas. (Toffoli, Capobianco and Mentrasti, 2006; in preparation.) Every reversible cellular automaton can be rewritten as a lattice gas. (Kari, 1996 for d 2; Durand-Lôse, 2001 for the general case.) 47
48 Conjecture (Toffoli, Capobianco and Mentrasti, 2006) Cellular automata that can be rewritten as lattice gases are precisely those in the classes RCA and NCA. That is: a cellular automaton can be rewritten as a lattice gas iff it is both injective and surjective, or neither. 48
49 Evolution of the species 1 The grid underlying a cellular automaton satisfies two constraints: 1. each node has a finite number of one-step neighbors, and 2. the shape of one-step neighborhood is the same for all nodes. This also happens with Cayley graphs of finitely generated groups. In this case, a natural action is defined (beware of order!) c g (h) = c(gh) h G so that a local map f : Q N Q still induces a global map (F(c)) g = f (c g N ) 49
50 Evolution of the species 2 Symbolic dynamics studies the properties of shift subspaces, i.e., closed, translation invariant subspaces of Q Z. This definition extends to subsets of Q G whatever G is. Cellular automata are called sliding block codes, and are seen mostly as transformations between shift subspaces. However, it is always possible to require F A (X) X. We can then define generalized cellular automata, whose phase spaces are shift subspaces X Q G. (Fiorenzi, 2000; Capobianco, 2004) 50
51 Evolution of the species 3 Given c 1, c 2 Q Z, we can consider the pseudodistance d(c 1, c 2 ) = sup n N {x Z x n, c 1 (x) c 2 (x)} 2n + 1 By identifying configurations having pseudodistance 0, we obtain a metrizable space. Cellular automata induce transformations of the quotient space, which can give information on the original cellular automaton. This can be done (with some caution) with more complicated groups in place of Z. (Formenti, 1998; Capobianco, 2006) 51
52 Cellular automata on the Web Cellular automata FAQ Ted Bach s SIMP pm.bu.edu/simp alpha/ Jörg R. Weimar s JCASim Stephen Wolfram s articles Compendia T. Toffoli, N. Margolus, Invertible cellular automata: A review, Physica D 45 (1990), J. Kari, Theory of cellular automata: A survey, Theor. Comp. Sci. 334 (2005),
53 Thank you for your attention! 53
A 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 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 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 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 informationStructure and Invertibility in Cellular Automata
Università degli Studi di Roma La Sapienza Dipartimento di Matematica G. Castelnuovo Tesi di Dottorato in Matematica Structure and Invertibility in Cellular Automata Silvio Capobianco December 2004 2 Acknowledgements
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 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 informationClassification of two-dimensional binary cellular automata with respect to surjectivity
Classification of two-dimensional binary cellular automata with respect to surjectivity Henryk Fukś and Andrew Skelton epartment of Mathematics Brock University St. Catharines, ON, Canada Abstract While
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 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 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 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 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 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 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 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 in Non-Euclidean Spaces
Cellular Automata in Non-Euclidean Spaces SHUICHI YUKITA Faculty of Computer and Information Sciences Hosei University 3-7-2 Kajino-cho Koganei-shi Tokyo 184-8584 JAPAN Abstract: Classical results on the
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 informationarxiv: v3 [cs.fl] 8 May 2018
Noname manuscript No. (will be inserted by the editor) A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications (Draft version) Kamalika Bhattacharjee Nazma Naskar Souvik Roy Sukanta
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 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 informationA Brief History of Cellular Automata
A Brief History of Cellular Automata PALASH SARKAR Indian Statistical Institute Cellular automata are simple models of computation which exhibit fascinatingly complex behavior. They have captured the attention
More informationPeriodic Cellular Automata of Period-2
Malaysian Journal of Mathematical Sciences 10(S) February: 131 142 (2016) Special Issue: The 3 rd International Conference on Mathematical Applications in Engineering 2014 (ICMAE 14) MALAYSIAN JOURNAL
More informationProcedures for calculating reversible one-dimensional cellular automata
Procedures for calculating reversible one-dimensional cellular automata Juan Carlos Seck Tuoh Mora Sergio V. Chapa Vergara Genaro Juárez Martínez Departamento de Ingeniería Eléctrica, Sección Computación,
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 informationMitchell 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 informationCellular 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 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 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 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 informationLIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon
LIP Laboratoire de l Informatique du Parallélisme Ecole Normale Supérieure de Lyon Institut IMAG Unité de recherche associée au CNRS n 1398 Inversion of 2D cellular automata: some complexity results runo
More informationarxiv: v2 [cs.fl] 21 Sep 2016
A A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications Kamalika Bhattacharjee, Indian Institute of Engineering Science and Technology, Shibpur Nazma Naskar, Seacom Engineering
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 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 informationFibonacci, Kronecker and Hilbert NKS Klaus Sutner Carnegie Mellon University sutner
Fibonacci, Kronecker and Hilbert NKS 2007 Klaus Sutner Carnegie Mellon University www.cs.cmu.edu/ sutner NKS 07 1 Overview Fibonacci, Kronecker and Hilbert??? Logic and Decidability Additive Cellular Automata
More informationTHE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE. 1. Introduction
THE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE HASAN AKIN Abstract. The purpose of this short paper is to compute the measure-theoretic entropy of the onedimensional
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 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 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 informationCellular Automata CS 591 Complex Adaptive Systems Spring Professor: Melanie Moses 2/02/09
Cellular Automata CS 591 Complex Adaptive Systems Spring 2009 Professor: Melanie Moses 2/02/09 Introduction to Cellular Automata (CA) Invented by John von Neumann (circa~1950). A cellular automata consists
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 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 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 informationa cell is represented by a triple of non-negative integers). The next state of a cell is determined by the present states of the right part of the lef
MFCS'98 Satellite Workshop on Cellular Automata August 25, 27, 1998, Brno, Czech Republic Number-Conserving Reversible Cellular Automata and Their Computation-Universality Kenichi MORITA, and Katsunobu
More information10 Cellular Automata and Lattice Gases
10 Cellular Automata and Lattice Gases We started our discussion of partial differential equations by considering how they arise as continuum approximations to discrete systems(such as cars on a highway,
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 informationOn a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane
Proceedings of the International Workshop, Automata for Cellular and Molecular Computing, MTA SZTAKI, Budapest, pages 9-7, 27. On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane
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 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 informationThe domino problem for structures between Z and Z 2.
1/29 The domino problem for structures between Z and Z 2. Sebastián Barbieri LIP, ENS de Lyon Turku October, 215 2/29 G-subshifts Consider a group G. I A is a finite alphabet. Ex : A = {, 1}. I A G is
More informationABridgeofBits. Norman Margolus Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA
ABridgeofBits Norman Margolus Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 July 1992 Abstract Cellular Automata are discrete physics-like systems that can be
More informationNilpotency and Limit Sets of Cellular Automata
Nilpotency and Limit Sets of Cellular Automata Pierre Guillon 1 and Gaétan Richard 2 1 Université Paris-Est Laboratoire d Informatique Gaspard Monge, UMR CNRS 8049 5 bd Descartes, 77454 Marne la Vallée
More informationA Topological Classification of D-Dimensional Cellular Automata
A Topological Classification of D-Dimensional Cellular Automata by Emily Gamber A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment of the
More informationAnalyzing Cellular Automata
Analyzing Cellular Automata Klaus Sutner Carnegie Mellon University Pittsburgh, PA 15213 sutnerqcs.cmu.edu, http://www.cs.cmu.edu/~sutner Abstract We demonstrate automata, a Mathematica/C+i- hybrid system,
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 informationThe Game (Introduction to Digital Physics) *
The Game (Introduction to Digital Physics) * Plamen Petrov ppetrov@digitalphysics.org In the present brief article we introduce the main idea of Digital Physics in the form of an abstract game. 1 Introduction
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 informationCatalan numbers and power laws in cellular automaton rule 14
November 7, 2007 arxiv:0711.1338v1 [nlin.cg] 8 Nov 2007 Catalan numbers and power laws in cellular automaton rule 14 Henryk Fukś and Jeff Haroutunian Department of Mathematics Brock University St. Catharines,
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 informationThermodynamics and Hydrodynamics with Cellular Automata
Thermodynamics and Hydrodynamics with Cellular Automata James B Salem Thinking Machines Corporation, 245 First Street, Cambridge, MA 02144 and Stephen Wolfram The Institute for Advanced Study, Princeton
More informationNon-emptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
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 information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 8 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 8 Nancy Lynch Today More undecidable problems: About Turing machines: Emptiness, etc. About
More informationMath 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions
Math 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions Please read this pdf in place of Section 6.5 in the text. The text uses the term inverse of a function and the notation f 1
More informationLogic 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 informationUndecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines
More informationTilings on different structures: exploration towards two problems
École Normale Supérieure de Lyon Master 2 Rapport Tilings on different structures: exploration towards two problems Author: Sebastián Barbieri Supervisor: Dr. Nathalie Aubrun A report submitted in fulfilment
More informationIntroduction to mathematical quasicrystals
Introduction to mathematical quasicrystals F S W Alan Haynes Topics to be covered Historical overview: aperiodic tilings of Euclidean space and quasicrystals Lattices, crystallographic point sets, and
More informationDimension sensitive properties of cellular automata and subshifts of finite type
Charalampos Zinoviadis Dimension sensitive properties of cellular automata and subshifts of finite type TUCS Technical Report No 977, May 2010 Dimension sensitive properties of cellular automata and subshifts
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 informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize
More informationComputational Fluid Dynamics: FHP-I & FHP-III
Computational Fluid Dynamics: FHP-I & FHP-III Mark Alexander Kaltenborn May 2, 2015 Introduction to FHP The FHP model is a type of lattice gas automata(ga), or lattice gas cellular automata, which is used
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationBoolean circuits. Lecture Definitions
Lecture 20 Boolean circuits In this lecture we will discuss the Boolean circuit model of computation and its connection to the Turing machine model. Although the Boolean circuit model is fundamentally
More informationThe Nature of Computation
The Nature of Computation Introduction of Wolfram s NKS Complex systems research center Zhang Jiang What can we do by computers? Scientific computation Processing data Computer simulations New field emerging
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
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 informationTuring Machines. Nicholas Geis. February 5, 2015
Turing Machines Nicholas Geis February 5, 2015 Disclaimer: This portion of the notes does not talk about Cellular Automata or Dynamical Systems, it talks about turing machines, however this will lay the
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationComputability, Undeciability and the Halting Problem
Computability, Undeciability and the Halting Problem 12/01/16 http://www.michael-hogg.co.uk/game_of_life.php Discrete Structures (CS 173) Lecture B Gul Agha 1 Based on slides by Derek Hoiem, University
More informationIntroduction to Automata
Introduction to Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 /
More informationOn Decidability Properties of One-Dimensional Cellular Automata
On Decidability Properties of One-Dimensional Cellular Automata arxiv:0903.4615v1 [cs.lo] 26 Mar 2009 Olivier Finkel Equipe de Logique Mathématique CNRS et Université Paris 7, France. finkel@logique.jussieu.fr
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationCellular 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 informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
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 informationo or 1. The sequence of site values is the "configuration" of the cellular automaton. The cellular
Physica loo (1984) vii- xii North-Holland. Amsterdam VlI PREFACE Stephen WOLFRAM The Institute /or Advanced Study, Princeton, NJ 08540, USA 1. Introduction Differential equations form the mathematical
More informationComputability and Complexity
Computability and Complexity Lecture 5 Reductions Undecidable problems from language theory Linear bounded automata given by Jiri Srba Lecture 5 Computability and Complexity 1/14 Reduction Informal Definition
More informationTheory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute Of Technology, Madras
Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute Of Technology, Madras Lecture No. # 25 Problems and Solutions (Refer Slide Time: 00:16) Today,
More information1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
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 informationNew Possibilities for Cellular Automata in Cryptography
New Possibilities for Cellular Automata in Cryptography Mauro Tardivo Filho Marco A. A. Henriques Faculty of Electrical and Computer Engineering University of Campinas Sao Paulo - Brazil Overview 1. History
More informationGriffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0
Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0 Turing Machines Now for a machine model of much greater power.
More informationLaboratoire de l Informatique du Parallélisme
Laboratoire de l Informatique du Parallélisme Ecole Normale Supérieure de Lyon Unité de recherche associée au CNRS n 1398 The Game of Life: universality revisited B. Durand, Zs. Roka January 1998 Research
More informationCSE355 SUMMER 2018 LECTURES TURING MACHINES AND (UN)DECIDABILITY
CSE355 SUMMER 2018 LECTURES TURING MACHINES AND (UN)DECIDABILITY RYAN DOUGHERTY If we want to talk about a program running on a real computer, consider the following: when a program reads an instruction,
More informationCOMPLETE NORMALITY AND COUNTABLE COMPACTNESS
Topology Proceedings Vol 17, 1992 COMPLETE NORMALITY AND COUNTABLE COMPACTNESS PETER J. NYIKOS, BORIS SHAPIROVSKIĬ, ZOLTÁN SZENTMIKLÓSSY AND BOBAN VELIČKOVIĆ One of the classical separation axioms of topology
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 informationCharacterization of Fixed Points in Sequential Dynamical Systems
Characterization of Fixed Points in Sequential Dynamical Systems James M. W. Duvall Virginia Polytechnic Institute and State University Department of Mathematics Abstract Graph dynamical systems are central
More information