Modeling of Cellular Automata and Agent-Based Complex Systems
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Universality of Evolved Cellular Automata In-Materio
Universality of Evolved Cellular Automata in-Materio STEFANO NICHELE12?,SIGVE SEBASTIAN FARSTAD1,GUNNAR TUFTE1 1 Department of Computer and Information Science, Norwegian University of Science and Technology, Norway 2 Department of Computer Science, Oslo and Akershus University College of Applied Sciences, Norway Received xxxxx; In final form xxxxx Evolution-in-Materio (EIM) is a method of using artificial evolu- tion to exploit physical properties of materials for computation. It has previously been successfully used to evolve a multitude of different computational devices implemented in physical ma- terials. One of the biggest problems in exploiting materials is finding a good computational abstraction to carry computation on top of the underlying physical process. This paper presents elementary cellular automata (CA) as a possible abstraction and presents successfully evolved CA transition functions in single- walled carbon nanotube (SWCNT) and polymer composite ma- terials. Such implementation allows reasoning about the compu- tational capabilities of materials and draw analogies with cellu- lar automata complexity and computation at the Edge of Chaos. This work is done within the European Project NASCENCE. Key words: Evolution-in-Materio, Cellular Automata, Edge of Chaos, Single-Walled Carbon Nanotubes, Complexity, Computational Materi- als. ? email: [email protected] 1 1 INTRODUCTION The natural evolutionary process, in stark contrast to the traditional human top-down building-block-oriented engineering approach, is not one of ab- straction, componentization and careful manipulation based on an under- standing of underlying mechanics. Rather, it is a ”blind-yet-guided” meta- heuristic approach able to exploit properties to create ”designs” without need- ing to understand them or the underlying mechanics that power them. -
CSE 30151 Theory of Computing Fall 2017 Project: Cellular Automata
CSE 30151 Theory of Computing Fall 2017 Project: Cellular Automata Version 1: Jan. 17, 2018 Contents 1 Overview 2 2 History 2 3 Defining a Cellular Automata 3 3.1 State . 3 3.2 Rules . 3 3.3 Topology . 4 3.4 1D CAs . 4 4 CAs to be Implemented 4 4.1 1D CA . 5 4.1.1 Codes . 5 4.1.2 Test Cases . 5 4.2 TwoD Totalistic CA . 6 4.3 TwoD General CA . 6 5 Documentation 7 5.1 readme-team . 7 5.2 Individual Machines . 7 5.3 teamwork-netid . 8 6 Submission 8 7 Grading 9 1 1 Overview You have all probably seen Conway's \Game of Life" [3] The purpose of this project is to introduce you to a generalization of that game, termed cellular automata or CA. In this paradigm there is a possibly infinite grid of cells which interact with each other via a set of rules that use some region around each cell. Depending on the size of the team, you will implement one or more CAs of varying complexity, and design initial configurations that produce \interesting" results. These implementations will then be run with varying initial conditions, and generate time series displays of the CAs. You are free to use C, C++, Python, or even your Arduino. Python in particular has proven in the past as perhaps the most efficient way to get decent working code (the overall goal). If you use Python, feel free to use the time, csv, sys, copy, itertools, and pygame modules. Use of any other modules requires preapproval of the instructor. -
Cellular Automata
Cellular Automata Mus270C Cellular Automata • Discrete Dynamical System – Space and 9me • Dimension – 1-D, 2-D, … • States – Neighborhood and neighbors • Rules 2 1-D Cellular Automata • Neighborhood 3 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) 4 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules 5 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 6 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 t = 2 7 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 t = 2 8 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 t = 2 9 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 t = 2 10 1-D Cellular Automata • Neighborhood • Black & White neighbors (States) • Rules • Example t = 1 t = 2 11 Wolfram Code Every cell and its two neighbors will be one of the following types Represent a black cell with 1 and a white cell with 0 1 1 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 0 0 1 0 0 0 Every yellow cell above can be filled out with a 0 or a 1 giving a total of 2 8=256 possible update rules. This allows any string of eight 0s and 1’s to represent a dis9nct update rule Example: Consider the string 0 1 1 0 1 0 1 0 it can be taken to represent the update rule 1 1 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 0 0 1 0 0 0 0 1 1 0 1 0 1 0 Or equivalently Now think of 01101010 as the binary expansion of the number 0 27+ 1 26+ 1 25+ 0 24+1 23+ 0 22+ 1 21+ 0 20 = 64+32+8+2=106. -
Modelling with Cellular Automata
Modelling with cellular automata Modelling with cellular automata Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Modelling with cellular automata Outline Outline of Topics Concepts about cellular automata Elementary Cellular Automaton Langton's ant Game of life CA for Lotka-Volterra model Conclusion Modelling with cellular automata Concepts about cellular automata What are cellular automata? I 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”. I The grid is usually in 2D, but can be in any finite number of dimensions. I The cells evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells. I Originated from von Neumann, populated in 70s' by John Conway's Game of Life, further researched by Stephen Wolfram I Can be seen as the simplest agent-based models Modelling with cellular automata Concepts about cellular automata Why CA are important? I The best tool to model and study complex system, because: I They are simple; I The mechanisms are completely known; I They can do just about anything I They might help us understand our universe: is the universe a cellular automaton? I They have lots of applications, e.g., random number generator. Modelling with cellular automata Concepts about cellular automata Some CA based biological models I Pattern formation in biology, e.g., Conus textile I Modelling cell interactions: brain tumor growth. Modelling with cellular automata Elementary Cellular Automaton Elementary Cellular Automaton I The simplest: One dimensional; I Two possible states per cell: `0' and `1'; I A cell's neighbors defined to be the adjacent cells on either side of it.