Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Cellular Automata Bookstore
Page 5     81-100 of 146    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20

         Cellular Automata:     more books (100)
  1. Proceedings / Parcella 1988: Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988 (Lecture Notes in Computer Science)
  2. Cellular automata modeling of resistance to innovations: Effects and solutions [An article from: Technological Forecasting & Social Change] by S. Moldovan, J. Goldenberg, 2004-06-01
  3. Cellular Automata and Complex Systems (Nonlinear Phenomena and Complex Systems)
  4. Cellular Automata and Modeling of Complex Physical Systems: Proceedings of the Winter School, Les Houches, France, February 21-28, 1989 (Springer Proceedings in Physics) by P. Manneville, N. Boccara, et all 1990-03
  5. ACRI '96: Proceedings of the second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16-18 October 1996
  6. Cellular Automata: A Parallel Model (Mathematics and Its Applications)
  7. Modelling Urban Development with Geographical Information Systems and Cellular Automata by Yan Liu, 2008-10-27
  8. Automata Networks: LITP Spring School on Theoretical Computer Science, Argeles-Village, France, May 12-16, 1986. Proceedings (Lecture Notes in Computer Science)
  9. Formal Models of Communicating Systems: Languages, Automata, and Monadic Second-Order Logic (Texts in Theoretical Computer Science. An Eatcs Series) by Benedikt Bollig, 2006-10-10
  10. Identification Of Cellular Automata by Andrew I. Adamatzky, 1994-11-25
  11. Using a cellular automaton model to forecast the effects of urban growth on habitat pattern in southern California [An article from: Ecological Complexity] by A.D. Syphard, K.C. Clarke, et all 2005-06-01
  12. Cellular Automaton Modeling of Biological Pattern Formation by Andreas Deutsch, Sabine Dormann, 2004-10-28
  13. Implementation and Application of Automata: 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers (Lecture Notes in Computer Science)
  14. Implementation and Application of Automata: 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers (Lecture Notes in Computer Science)

81. Automata - Agents Of Life Within
Introduction to cellular automata and other types including the Game of Life, and their applicability to artificial life, nanotechnology, mind and society.
Automata - Agents of Life Within
by Chris Lucas
"On mechanical slavery, on the slavery of the machine,
the future of the world depends."
Oscar Wilde, The Soul of Man Under Socialism, 1895
In this introduction we will look at some building blocks of organisation, both in terms of life (real and artificial) and in the structure of inorganic materials. We will investigate Cellular Automata and relate these to computers, brains and cells, plus speculate on the future goals of nanotechnology.
Understanding Automata
Firstly what exactly is an automaton ? Most people will recognise the word as one applied to a mechanical toy that emulates some apparently living behaviour. Within our field this is generalised to any system that has a finite number of internal states and moves between those states by following specified rules - this is a form of mapping (input to output, similar to a computer program). An automaton is also an agent in ALife terms, although agents can also occur in many other forms. An agent is an entity that can interact with its surroundings and usually changes its own state as a result. If we bring together a collection of such agents and allow them to interact then we have an automata system.
Cellular Automata
If we assume automata to be fixed (not mobile) we can equate them with cells in a structure. This structure could be living, molecular, mechanical - any form in fact. This gives us a Cellular Automata (CA), a structure that, whilst static in physical form and space, can exhibit dynamic behaviour in time - emergent order.

82. ISU Complex Computation Lab
2D generalpurpose cellular automata simulators for Unix or Java at Iowa State University.
Skip the Introduction Skip the Introduction

The Primordial Soup KitchenColorful images and Java movies of cellular automata, with recipes to explain their genesis. Also some tasty Real Recipes. Introduction. What s Cooking?

84. Personal Home Page Of Mirek Wojtowicz
1D and 2D cellular automata viewer, explorer and editor by Mirek Wojtowicz. Huge libraries of CA rules and patterns, gallery of CA rules, news, links. Free 32bit Windows MCell software.
Welcome to
Mirek's Personal Home Page
[Cellular Automata ]

[ Miscellaneous ]
[ Discussion forum ]

Advanced search

Active Cellular Automata mirrors:
USA Europe All software is provided to you on an "as is" basis, and is used by you at your own risk. I will not be responsible for any loss or damage Thank you to David Fairbairn at for his help with my usage of the English language. Webmaster: Mirek Wójtowicz Last update: 06 May 2004 (zv)

85. Java Cyclic Cellular Automata
Cyclic cellular automata. Cyclic cellular automata (CCA) exhibit complex selforganization by iteration of an extremely simple update rule.
Cyclic Cellular Automata
Cyclic Cellular Automata (CCA) exhibit complex self-organization by iteration of an extremely simple update rule. Using a cyclic color wheel, the state of each cell advances to the next in the cycle if and only if it sees a sufficient representation of that next color within its prescribed local neighborhood. Here 'enough' is measured by a threshold parameter. CCA dynamics are featured extensively on the Kitchen Shelf . This Java-based CCA simulator, with 10 demo experiments, provides an overview of the model's behavior at various representative locations in phase space. The interface is essentially the same as for our companion Greenberg-Hastings Page . Many of the capsule descriptions are linked to explanatory recipes from the Shelf. The Table at the bottom prescribes each experiment's parameters. Click on the number index of an experiment to go to its Table entry, and vice versa, or click on the Table's upper left # symbol to jump to the applet. Try other parameter combinations to develop your predictive understanding of these excitable dynamics, and consult our research paper Threshold-Range Scaling of Excitable Cellular Automata for a systematic study.

86. Howard Gutowitz's Home Page
Papers and preprints about cellular automata, Chaos, Complexity, and Dynamical Systems.
Howard Gutowitz
Visits since Dec 10, 1995: If you want to know what I'm doing now, go to:

87. Game Studies 0102: Sims, BattleBots, Cellular Automata, God And Go. By Celia Pea
Sims, BattleBots, cellular automata God and Go. It’s kind of the board game version of John Conway’s Game of Life, the cellular automata game.
the international journal of computer game research
volume 2, issue 1

July 2002
home about ... archive Celia Pearce is a game designer, artist, teacher and writer. She is the designer of the award-winning virtual reality attraction Virtual Adventures: The Loch Ness Expedition , and the author of The Interactive Book: A Guide to the Interactive Revolution (Macmillan, 1997) as well as numerous essays on game design and interactivity. She currently holds a position as Lecturer in Studio Art at the University of California Irvine's Claire Trevor School of the Arts.
Sims, BattleBots, Cellular Automata God and Go
A Conversation with Will Wright by Celia Pearce
Conducted in Will Wright's office at Maxis, September 5, 2001 CP: What is your philosophy of interactive design? WW: Ooh, a heavy question, a philosophy question. they CP: When you were first working on SimCity , what was going on in the game world at that time? Were you responding to games that were out there, were you wanting something different? Were there things that influenced you at all in the game world or were you just totally in a different mindset? Pinball Construction Set by Bill Budge which was great. He was kind of playing around with the first pre-Mac Lisa interface, which was icon-based. He actually put this in the game, even though it was an Apple 2 game. He kind of emulated what would later become the Mac interface. But it was very easy to use, and you would create pinball sets with it which you could then play with. I thought that was very cool.

88. MFCS'98 Workshop On Cellular Automata
MFCS 98 Workshop on cellular automata. A Satellite Workshop to MFCS 98. The Aim, cellular automata have attracted a lot of attention recently.
MFCS'98 Workshop on Cellular Automata
A Satellite Workshop to MFCS'98
August 25-27, 1998, Brno, Czech Republic
The Aim
Cellular Automata have attracted a lot of attention recently. Progress has been made in several areas and new topics have been brought up for further research. The aim of the workshop is to allow for an exchange of ideas, to highlight new approaches and results (as well as problems), and to present them to a broader audience in the MFCS CSL environment.
Topics Suggested topics of interest include (but are not limited to): cellular automata as models of parallelism, computational complexity of cellular automata, cellular automata as dynamical systems, cellular automata as complex systems, cellular automata models for real phenomena (in physics, biology, etc.), algebraic properties of cellular automata, cellular automata machines, generalizations of cellular automata, modelling interactive behaviour with cellular automata.

Authors are invited to send one copy of an extended abstract not exceeding ten pages to the PC chair. Electronic submissions in the form of a LaTeX (preferred) or postscript file are encouraged and can be sent to

89. Pawel Siwak's Home Page
Theoretical introduction to finite automata, cellular automata, iterons and solitons, by Pawel Siwak.
Pawel Siwak's Home Page Adjunct Professor Poznan University of Technology
Department of Electrical Engineering
Chair of Control, Robotics and Computer Science pl. M. Sklodowskiej-Curie 5
60-965 Poznan
Poland Phone
Me, Pawel, and my favourite Filtron Milosz Teaching duties Cellular computations
Multiple computational systems
Dynamics of computations of discrete complex systems
Basics of parallel processing Computer graphics Research interests Automata, cellular automata, and other formal computational models Massive parallel computations, e.g.: systolic, pipelined, solitonic Nonlinear phenomena: discrete models of solitonic interactions, guiding light with light Arranging computations in automata-like media Publications Selected publications with some abstracts Recent talks References relevant to my interests Tutorials Finite automata Cellular automata Iterons Solitons CV Related www-sites Hobbies Established: February, 1999

90. Vie Artificielle, Présentation Et Illustration Java. Introduction To Artificial
Windows software that implements some 1D cellular automata and can be used to test Wolfram's and Langton's classifications; by J.P. Rennard.
Introduction to Artificial Life and Java Illustration Francais English
chercher sur

91. Wei Qi, Cellular Automata, Ising Model, Feynman Checkerboard
Ising Models. which can be represented by. cellular automata. which are like. Wei Qi. Feynman Checkerboards. cellular automata. Wei Qi. Tony s Home ..
Tony's Home
Feynman Checkerboards
in 1+1 dimensions are isomorphic to 1-dimensional
Ising Models
which can be represented by
Cellular Automata
which are like
Wei Qi
Feynman Checkerboards
A single FEYNMAN CHECKERBOARD configuration is one of all possible ways for an electron to go from an initial point to a destination point. Choice of a particular single configuration is a RANDOM quantum choice. Feynman's Relativistic Chessboard as an Ising Model, by H. A. Gersch (Int. J. Theor. Phys. 20 (1981) 491), shows that the (1+1)-dimensional Feynman Checkerboard, which describes the (1+1)-dimensional Dirac equation , is equivalent to the 1-dimensional Ising model and is related to Bernoulli Schemes, Julia Sets, and Chebyshev Polynomials The Feynman Checkerboard for an electron in 1+1 dimensional spacetime can be represented as a 1-dimensional Cellular Automaton evolving in 1 time dimension. The initial state is a point in the t=0 initial time, the initial location of the electron in 1-dimensional space. Each possible state at time t=N is a point locating the electron on the spatial line at t=N. All possible paths from the initial state at t=0 to the state at t=N are summed ( the Quantum Sum Over Histories 2 +/- sqrt(2 +/- sqrt(2 +/- sqrt(2 +/- ... ))) Such sequences of length M are the zeroes of the Chebyshev polynomials of degree 2^M.

92. Cabrowser
Beta version of the cellular automata Browser, a combination of Java and JavaScript that allows to browse through a large number of one-dimensional CA-rules, by Martin Schaller.
cabrowser (beta-version 0.2)
Unfortunately the combination of JavaScript and Java on these pages needs Internet Explorer 5.0 or higher. #site

93. Digital Physics
A site devoted to the Edward Fredkin's idea that our entire Universe can be represented as a computer program. FAQ, relevant articles, cellular automata pictures, movies, VRML models and programs.
"What cannot be programmed, cannot be physics."
E. Fredkin
    Is it possible to describe the whole Universe as a computer program? What is the algorithm that runs our Universe? According to the theory of Digital Physics, information is more fundamental than matter and energy; time and space are discrete, and laws of physics are deterministic. The solution of the problem itself lies somewhere within a class of abstract mathematical models for computation known as "cellular automata"...
    Welcome - introduction, a bit of history, frequently asked questions ( FAQ Mail - DP mailing list subscription information and archives News and Events - new developments, current events and happenings Publications - relevant papers, articles, and references Automata - cellular automata pictures, movies, VRML models, and programs Programs - software tools Links - DP links, related areas of study, researchers, organizations The Future - things to do, open problems, ideas and thoughts
Last updated: March 30 th , 2004, by
Joel Dobrzelewski
– email:

94. IFIP Cellular Automata Workshop 96
Institute of Informatics University of Giessen. IFIP cellular automata Workshop 96. Schloss Rauischholzhausen near Giessen March 25 - 27, 1996.
Institute of Informatics - University of Giessen
IFIP Cellular Automata Workshop 96
Schloss Rauischholzhausen near Giessen
March 25 - 27, 1996
Under the head of the IFIP working group 14.5 we are inviting everyone interested in cellular automata to a workshop taking place in Rauischholzhausen (Germany) from March 25, 1996 to March 27, 1996
General information
Program and participants
Dates and deadlines
  • Workshop: Mar 25, '96 - Mar 27, '96
  • Registration: Feb 2, '96
  • Summaries: Mar 8, '96
How to get there
For further information you can also contact the organizers or send a mail via the World Wide Web.
Tue Feb 24 11:50 MET 1998

95. Mirek's Java Cellebration
General cellular automata Java applet running over 200 rules from 12 CA families, equipped with a big library of patterns. By Mirek Wojtowicz.
Mirek's Java Cellebration v.1.50 what's new?
Go back to MCell Home Mirek's Java Cellebration (MJCell) is a Java applet that allows playing 300+ Cellular Automata rules and 1400+ patterns. It can play rules from 13 CA rules families: Generations Life Vote Weighted Life ... Larger than Life , and some of the User DLLs . It allows also to experiment with own rules. The applet is a simplified version of MCell. It does not offer extended features of MCell, but has one advantage over it: its usage is not restricted to MS Windows. Full source code of the applet is available here . You can also download the full off-line version equipped in a rich library of patterns. You should also download this version if you plan to put the MJCell applet on your own Web page. To start the applet, click on the "Start" button below. The applet will show up in its own window. For the description of all rules available in the applet refer to the CA rules page Sign my MJCell GuestBook Read my MJCell GuestBook
[ GuestBook by

96. Historical Notes: History Of Cellular Automata
A New Kind of Science Notes for Chapter 2 The Crucial Experiment Section Why These Discoveries Were Not Made Before Page 876 History of cellular automata.
From: Stephen Wolfram, A New Kind of Science
Notes for Chapter 2: The Crucial Experiment
Section: Why These Discoveries Were Not Made Before
History of cellular automata. Despite their very simple construction, nothing like general cellular automata appear to have been considered before about the 1950s. Yet in the 1950s - inspired in various ways by the advent of electronic computers - several different kinds of systems equivalent to cellular automata were independently introduced. A variety of precursors can be identified. Operations on sequences of digits had been used since antiquity in doing arithmetic. Finite difference approximations to differential equations began to emerge in the early 1900s and were fairly well known by the 1930s. And Turing machines invented in 1936 were based on thinking about arbitrary operations on sequences of discrete elements. (Notions in physics like the Ising model do not appear to have had a direct influence.)
The best-known way in which cellular automata were introduced (and which eventually led to their name) was through work by John von Neumann in trying to develop an abstract model of self-reproduction in biology - a topic which had emerged from investigations in cybernetics. Around 1947 - perhaps based on chemical engineering - von Neumann began by thinking about models based on 3D factories described by partial differential equations. Soon he changed to thinking about robotics and imagined perhaps implementing an example using a toy construction set. By analogy to electronic circuit layouts he realized however that 2D should be enough. And following a 1951 suggestion from

97. Xtoys
A set of cellular automata simulators written for XWindows. By Mike Creutz.
( The directory xtoys contains a set of cellular automata simulators I have written for Xwindows. The executables here are for Linux. The xtoys gallery shows lots of pictures produced by these programs (beware if you have a slow link). To peek at the xising user interface, look here A further description of these files is in my contribution to the Lattice'95 proceedings. The files in the xtoys directory include:

98. The Cellular Automata Simulation System
A compiler for the Cellang cellular automata programming language, along with the corresponding documentation, viewer, and various tools; by J Dana Eckart.
The Cellular Automata Simulation System
The system consists of a compiler for the Cellang cellular automata programming language, along with the corresponding documentation, viewer, and various tools. Cellang has been undergoing refinement for the last several years, with corresponding upgrades to the compiler. Postscript versions of the tutorial and language reference manual are available for those wanting more detailed information. The most important distinguishing features of Cellang , include support for:
Links Go
Cellular Automata
  • named constants, including constant arrays with values read in from a file;
  • any number of dimensions;
  • compile time specification of each dimension's size;
  • cell neighborhoods of any size (though bounded at compile time) and shape;
  • positional and time dependent neighborhoods;
  • associating multiple values (fields), including arrays, with each cell;
  • associating a potentially unbounded number of mobile agents [ Agents are mobile entities based on a mechanism of the same name in the Creatures system, developed by Ian Stephenson (] with each cell; and
  • local interactions only, since it is impossible to construct automata that contain any global control or references to global variables.

99. Cellular Automata
cellular automata. Frequently Asked Questions About cellular automata; A tutorial on cellular automata; Graphics Applications of cellular automata.
Next: Frequently Asked Questions About Up: Web sites Previous: Extend
Cellular Automata

Gerhard Franz Plum

100. Dr.Cell Cellular Automata Simulator
A tool for simulating uniform or nonuniform cellular automata for a variety of neighborhood models, implemented in Scheme (a dialect of Lisp) using PLT's Dr.Scheme.
Dr.Cell Cellular Automata Simulator Dr.Cell is a CA simulation tool implemented in Scheme programming language (a dialect of Lisp) using PLT's Dr.Scheme Dr.Cell allows you to simulate 1D, 2D, Uniform and Non-Uniform Cellular Automata graphically with user defined neighborhood models and rule sets. Following are a few samples that are implemented using Dr.Cell: You can load simulations using the Cellular Universe Control Center and execute multiple simulations at the same time. For each simulation there will be an individual window (Cellular World) showing the graphic representation of the simulation along with the cell statistics. Once a cellular world is created you can add more "automata" (Artificial Life Forms) on to the world and see their interactions. For example you can create a world for "Carrots" containing a specific rule set for the "Carrots". Then you may define another life-form "Rabbits" with the rule set for rabbits and add it to the "carrot world" and see how carrot and rabbit population evaluating in time. Dr.Cell allows you to adjust the speed of a simulation. You can also stop a simulation at any given time and execute it step by step.

Page 5     81-100 of 146    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20

free hit counter