CellularAutomata - A Brief History of Cellular Automata...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
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 of several generations of researchers, leading to an extensive body of work. Here we trace a history of cellular automata from their beginnings with von Neumann to the present day. The emphasis is mainly on topics closer to computer science and mathematics rather than physics, biology or other applications. The work should be of interest to both new entrants into the field as well as researchers working on particular aspects of cellular automata. Categories and Subject Descriptors: F.1.1 [ Conputation by abstract devices ]: Models of Computation; K.2 [ Computing Milieux ]: History of Computing General Terms: Theory Additional Key Words and Phrases: Cellular automata, cellular space, homogeneous structures, systolic arrays, tessellation automata 1. INTRODUCTION Cellular automata were originally pro- posed by John von Neumann as formal models of self-reproducing organisms. The structure studied was mostly on one- and two-dimensional infinite grids, though higher dimensions were also considered. Computation universality and other computation-theoretic ques- tions were considered important. See Burks [1970] for a collection of essays on important problems on cellular au- tomata during this period. Later, physi- cists and biologists began to study cellu- lar automata for the purpose of modeling in their respective domains. In the present era, cellular automata are being studied from many widely differ- ent angles, and the relationship of these structures to existing problems are be- ing constantly sought and discovered. Next, we would like to clarify the purpose of this survey as compared to other related work. There is an excel- lent survey of CA by A.R. Smith III [Smith III 1976]. However, it is more than twenty years old. There are also two other surveys [Vollmar 1977; Ala- dyev 1974] which are quite old. Cur- rently, it is perhaps quite impossible to survey the whole of CA research. There is a good survey on computation theo- retic aspects of CA by Culik II et al. [1990]. There are also books on CA [Garzon 1995; Chaudhuri et al. 1997; Wolfram 1986] which cover specific top- ics of CA research. In this survey we try to cover the major questions asked about CA as opposed to the use of CA in Author’s address: Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta, India 700035; email: palash@isical.ac.in. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/30/2011 for the course COP 4810 taught by Professor Staff during the Spring '11 term at University of Central Florida.

Page1 / 28

CellularAutomata - A Brief History of Cellular Automata...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online