81. SRCA Christopher Osborn's Java applet exploring selfreproducing patterns. http://www.softrise.co.uk/srl/caworld.shtml

SRCA SRCA History Introduction Download ... Applet SRCA is a Cellular Automata (CA) Java application that implements some complex CA rules that give rise to self reproducing and evolving patterns. This application improves upon my original 'Self Reproducing Cellular Automata Loops' applet, with a better user interface, more functionality and more rules. The original applet is still available here if for some reason you cannot run SRCA. Please note that at present it is not possible to write your own CA rules for SRCA, but you can load/edit/save patterns and change some of optional parameter values on the existing rules. Moreover, SRCA is highly specialized in order to run certain types of rule well. See introduction for more details. I welcome any comments you may have on SRCA and related issues - see bottom of page for contact details. The image below is a screen shot of SRCA taken after running the SRL(8) rule on the default starting pattern for the indicated number of clock ticks. The two single loops that comprise the initial starting pattern have replicated and evolved into several colonies of different loop types, each competing for space. Basically this is a simulation of a very simple artificial universe in which self-replicating patterns grow, produce children, and eventually die. These self-reproducing patterns can be thought of as artificial primitive life forms. Initially the universe contains one or more loops (depending upon universe size). Each loop is a wire around which signals propagate. These signals are instructions for growing a child wire loop. Once a child loop has been grown, the signals from the parent loop are copied into it and it is then detached from the parent. The child then becomes a parent by growing its own children. As signals propagate along the wires there is a small possibility of corruption, causing mutant children and thus enabling gradual evolution of the wire loops into different shapes and sizes (and sometimes other transient structures). Wires have a finite lifetime, after which they decay into nothing.

82. Capow98 A Windows application that can simulate and analyze various onedimensional and two-dimensional cellular automata, part of the cellular automata and Electric Power project lead by Dr. Rudy Rucker. http://www.cs.sjsu.edu/faculty/rucker/capow/

83. Cellular Automata And Music www106.ibm.com/developerworks/java/library/j-camu cellular automataDavid Eppstein s selected cellular automata links Heavy on spaceship and replicatorinfo, in Conway s Life and other rules. Eric Weisstein s Treasure Trove http://www-106.ibm.com/developerworks/java/library/j-camusic/

var title = "Cellular automata and music"; var forumURL = ""; var contentAreaList = "java, "; var emailAbstract = "Take computers, mathematics, and the Java Sound API, add in some Java code, and you've got a recipe for creating some uniquely fascinating music. IBM Staff Software Engineer Paul Reiners demonstrates how to implement some basic concepts of algorithmic music composition in the Java language. He presents code examples and resulting MIDI files generated by the Automatous Monk program, which uses the open source jMusic framework to compose music based on mathematical structures called cellular automata."; Country/region select All of dW eServer Lotus Rational Tivoli WebSphere Autonomic computing Grid computing Java technology Linux Open source Power Architecture Web architecture Wireless XML dW forums dW Subscription alphaWorks All of IBM Home Products My account developerWorks ... Rate this page Related links Java technology technical library developerWorks Java technology Cellular automata and music Using the Java language for algorithmic music composition Document options Document options requiring JavaScript are not displayed Rate this page Help us improve this content Level: Introductory Paul Reiners reiners@us.ibm.com

84. The Primordial Soup Kitchen Colorful images and Java movies of cellular automata, with recipes to explain their genesis. Also some tasty Real Recipes. By David Griffeath. http://psoup.math.wisc.edu/kitchen.html

Introduction What's Cooking? 2000 PSK Calendar PSK Search ... CAffeine (Java) Kitchen Shelf Kitchen Sink Lagniappe Specialties I II Sign the Guestbook Research I II EAT (Real Recipes) Download Software: © David Griffeath Vita kudos browser issues

85. Historical Notes: History Of Cellular Automata The bestknown way in which cellular automata were introduced (and which There were also various explicit constructions done of cellular automata whose http://www.wolframscience.com/reference/notes/876b

SOME HISTORICAL NOTES From: Stephen Wolfram, A New Kind of Science Notes for Chapter 2: The Crucial Experiment Section: Why These Discoveries Were Not Made Before Page 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

86. Life.anu.edu.au/complex_systems/tutorial1.html Grant Robinson cellular automata launchercellular automata. cellular automata. Click to launch project Click to launchproject. About cellular automata. I was inspired to make these small apps http://life.anu.edu.au/complex_systems/tutorial1.html

ANU Home HORUS Staff Home Students ... RSBS Research School of Biological Sciences RSBS External Skip Navigation Search the ANU Website Handbook Admin Areas Phone List Staff Email Student Email Mail Archives for RSBS Navigation Bar Home About RSBS Collaborative Links Services ... Staff Directory Latest News News Job Opportunities Student Opportunities Quick Launch Access to Intranet Web Email Site Search Advanced Current research Student Opportunities Genomic Interactions We are studying the processes involved in plant meristem development and in plant responses to bacterial infection. As a team, we take an integrated approach to plant biology using a wide range of techniques including genetics, molecular biology, biochemistry, proteomics, cell biology and bioinformatics. We use two interacting well characterised model organisms - the legume Medicago truncatula and the soil bacteria Sinorhizobium meliloti to enable the role of specific genes, gene products and signalling molecules regulating growth and development to be assessed.

87. Moshe Sipper's Site Fine theoretical and practical introduction to cellular automata, ALife, and Complex Adaptive Systems. http://lslwww.epfl.ch/~moshes/

Home Research Publications Teaching Home Research Publications Teaching ... Sipperabilia

88. Hoke.html cellular automata (CA) manifest one of the most intriguing ideas in cellular automata, of which Von Neumann s selfreplicating automaton is just one http://www.dartmouth.edu/~matc/math5.pattern/FinalProject/Hoke.html

I. Introduction: A Brief History ...O fill me With strength against those who would freeze my humanity, would dragoon me into a lethal automaton, would make me a cog in a machine... Louis MacNeice, 1944 In the early 1950's, the well-known mathematician John Von Neumann was trying to develop what he termed a self-replicating automaton; that is, a machine whose computer brain was capable of devising instructions to effect the construction of itself. Von Neumann never actually intended for the machine to be built. Rather, he was interested in arriving at rules by which a computer could be programmed such that it could fashion an exact replica of itself. He envisioned initially a robot wandering around a warehouse littered with spare parts, identifying the relevant pieces, and fashioning an exact replica of itself. As the legend goes, Von Neumann fooled around with various approaches for a while but was not satisfied with the results. The physical movement of pieces by the robot did not seem to fit the mathematical theory he desired, nor did the complexity of various attempts at solution suit his liking. Von Neumann sought a solution that was simple, elegant, and general. Stanislaw Ulam, a fellow mathematician, suggested to Von Neumann a different approach. Consider a rectangular array of cells, much like a chessboard, in which each cell can exist in one of a finite number of states: 0, 1, 2, ... Time would progress discretely (i.e. in jumps, rather than continuously. Each increment of time would be a chance for cells to change their state. The rule governing the change of state for each cell would depend only upon the states of the cell's immediate neighbors and possibly upon the state of the cell itself. The rule would be the same for each cell and all cells would change (or not change) according to the rule with each time step. All cells would initially be in the 0, or quiescent, state; to start the automaton, place some cells in nonzero states and start the clock. Watch the cells and see how they changed according to their localbut commonrule. Ulam's grid was an example of a cellular automaton.

89. Hexatron :A Cellular Automaton A Java demonstration of cellular automata on a hexagonal grid. http://www.hexatron.com/hexca/index.html

home last next Hexatron presents: A Cellular Automaton You need Java to for this. This is a demonstration of cellular automata on a hexagonal grid. You can find out about cellular automata by starting at Yahoo/Science/Artificial_Life/Cellular_Automata A cell is alive if it is colored red. A live cell is generated by the arrangement of live cells in the six cells around it, and itself (see the rules below). The board shown wraps aroundthe top connects to the bottom and the sides are connected too. A bigger and slower version of this page The controls are: Run animates the automata Stop ceases animation. When Stop is on, the mouse can draw or erase live cells Step shows the next generation of cells Clear empties the field of live cells Spray makes a random selection of the cells live Glider drops a glider onto the board. A Glider is an arrangement of live cells that reproduces itself in a different position after a few generations. Puffer drops a puffer onto the board. A Puffer is a glider that leaves a trail. Spinner drops a spinner onto the board.

90. Game Studies 0102: Sims, BattleBots, Cellular Automata, God And Go. By Celia Pea Most simulation processes, such as system dynamics or cellular automata, destroyinformation. CP So you have to figure out what the systemic memory looks http://www.gamestudies.org/0102/pearce/

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. www.cpandfriends.com 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.

91. Welcome To Zooland! A big (200+) collection of resources for those interested in studying Artificial Life and cellular automata. http://surf.de.uu.net/zooland/

Last update: 08-JULY-2004 22:44 DST Welcome to Zoo land: "The Artificial Life Resource" ["Is this is for carbon-based life forms only?" -Ed.] "What's the color of a chameleon put onto a mirror?" -Stewart Brand A B C D ... Z What is Artificial Life? by Chris G. Langton B iology is the scientific study of life - in principle, anyway. In practice, biology is the scientific study of life on Earth based on carbon-chain chemistry. There is nothing in its charter that restricts biology to carbon-based life; it is simply that this is the only kind of life that has been available to study. Thus, theoretical biology has long faced the fundamental obstacle that it is impossible to derive general principles from single examples. Without other examples, it is difficult to distinguish essential properties of life - properties that would be shared by any living system - from properties that may be incidental to life in principle, but which happen to be universal to life on Earth due solely to a combination of local historical accident and common genetic descent. In order to derive general theories about life, we need an ensemble of instances to generalize over. Since it is quite unlikely that alien lifeforms will present themselves to us for study in the near future, our only option is to try to create alternative life-forms ourselves - Artificial Life - literally ``life made by Man rather than by Nature.''

92. Gliders In "Life"-Like Cellular Automata An online interactive database of rules with gliders, by D. Eppstein. http://www.ics.uci.edu/~eppstein/ca/

Which "Life"-Like Systems Have Gliders? John Conway's "Game of Life" has fascinated and inspired many enthusiasts, due to the emergence of complex behavior from a very simple system. One of the many interesting phenomena in life is the existence of "gliders": small patterns that move across the grid. Some authors have asserted that the gliders and other complex behaviors occurring in Life are unusual, for instance Wolfram: "Except for a few simple variants on the Game of Life, no other definite class-4 two-dimensional cellular automata were found in a random sample of several thousand outer totalistic rules." Are gliders really so rare? I have investigated whether gliders exist in many semitotalistic rules similar to Life, where the behavior of a cell depends only on its own state and the number of live neighbors. The results show that the existence of gliders is commonplace, contradicting Wolfram and calling into question his classification of cellular automata Jason Summers' c/5 diagonal spaceship in Life Online interactive database of rules with gliders Paper describing my glider search program and MSRI talk on streaming video Rules with self-replicating patterns New! Replicators in rules with B0, July 2002

93. ISU Complex Computation Lab 2D generalpurpose cellular automata simulators for Unix or Java at Iowa State University. http://www.complex.iastate.edu

Hui-Hsien Chou Choongseo Chung Song Li Ye Lin ... GDCB brown bag Last modified September 15, 2005

94. Free Software 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. http://www.mirekw.com/

Welcome to Mirek's Free Software Site [Cellular Automata ] MCell MJCell PINs ... Yahdice [ Miscellaneous ] RSDemon SetiMSpy [ Discussion forum ] Search this site: Partial search: Help Advanced Search Active Cellular Automata mirrors: USA http://psoup.math.wisc.edu/mcell/ Europe http://www.mirwoj.opus.chelm.pl/ca/ 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 Webmaster: Mirek Wojtowicz (Miros³aw Wójtowicz) http://www.mirekw.com http://www.mirwoj.opus.chelm.pl Last update: Mar 02, 2005 (lx2)

95. Cellular Automaton Fun introduction to cellular automata with interactive Java applets, includingthe game of life, a simulation of animal skin patterns and a screen saver. http://www.rufenacht.com/CA/

Fun with cellular automata One-dimensional cellular automata Game of life Simulation of animal patterns Screen saver Note: Your browser must have Java enabled to use the applets on these pages. One-dimensional cellular automata A cellular automaton is a group of cells that evolves only by nearest neighbor interaction. They are thought to be able to represent the evolution of living organisms and minerals. In one dimension, the cells are a line of points. Each point has a value, represented by a color. The evolution of each point is determined by its value and by the value of the neighboring points. By setting some simple rules for evolution, and picturing the evolution of the line of cells, it is possible to obtain very complex and beautiful patterns. Here are some examples giving an idea of the diversity of image that can result: In above examples, each point can take the values 0, 1, 2, or 3, corresponding respectively to the colors black, red, green, and blue. The initial state (i.e. the top line) is chosen randomly. Then, the cells evolve from top to bottom according to a set of rules, each line representing a step of evolution. How many rules are possible? If we consider only nearest neighbour interaction, and four colors, we have 4x4x4 = 64 different patterns possible of three cells. A rule of evolution is a function that relates each of these 64 patterns to one color. There are 4^64 patterns possible : it is a huge number, approximately 34000000000000000000000000000000000...

96. The Math Forum - Math Library - Cellular Automata The Math Forum s Internet Math Library is a comprehensive catalog of Web sitesand Web pages relating to the study of mathematics. This page contains sites http://mathforum.org/library/topics/cellular_auto/

Browse and Search the Library Home Math Topics Dynamical Systems : Cellular Automata Library Home Search Full Table of Contents Suggest a Link ... Library Help Selected Sites (see also All Sites in this category Cellular Automata Dynamics - Rafael Espericueta Explorations of 0-, 1-, and 2-dimensional cellular automata; and applications of cellular automata to ecosystem modeling. A slide show of the table of contents of the book is available here, as well as the full text of the book, in pdf format. more>> The Game of Life: (Serendip: Complex Systems) - Bryn Mawr College Order without a planner: play a Java game about a world consisting of locations that may or may not be occupied by life. At each step, life persists in any location where it is also present in two or three of the eight neighboring locations, and otherwise disappears (from loneliness or overcrowding). Life is born in any empty location for which there is life in three of the eight neighboring locations. What would life look like in such a world? Would it die out? Persist as a disordered, ever-changing blob? Create stable, discrete entities? Generate particular forms in the absence of a planner, an architect, a blueprint? Does it matter what the starting conditions are? With thanks to John Conway. more>> Mirek's Cellebration: 1D and 2D Cellular Automata explorer - Mirek Wojtowicz A large (120+) collection of 1D and 2D Cellular Automata. The site includes a lexicon, gallery, pattern of the week, CA families, rules, patterns, and links, with a CA tutorial and art. Also free Windows and Java software running all listed rules. The original site in Poland is at

97. Cellular Computations Theoretical introduction to finite automata, cellular automata, iterons and solitons, by Pawel Siwak. http://staff.sk-kari.put.poznan.pl/siwak/

98. 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. http://members.surfeu.at/tim2/cabrowser/cabrowser.html

cabrowser (beta-version 0.2) Unfortunately the combination of JavaScript and Java on these pages needs Internet Explorer 5.0 or higher. #site all rules all equivalence classes all space-symmetric rules all rules ... all state-symmetric equivalence classes all space-symmetric equivalence classes: (578 KB per page) all space- and state-symmetric equivalence classes rules found by Andrew Wuensche solitons described by Y. Aizawa., I. Nishikawa, K. Kaneko solitons 1011 ... solitons 11101 selection cabrowser References A lot of the rules above are described in research papers or online-documents. See the following list of references . For general information about cellular automata you might want try the link collection of the open directory project Known Problems Internet Explorer 5.0 works fine on my system, but Mirek Wójtowicz reported also some problems with this version. I didn't get Opera running the CA-Browser. History is not properly working: most of the times you have to click twice the Back-button to return to this page. Further Developments One of the main development lines is to integrate CAOS into the CA-Browser.

99. ACRI 2004 cellular automata, in spite of their apparent simplicity represent a very John von Neumann, who is recognized as the father of cellular automata, http://www.science.uva.nl/research/scs/events/ACRI2004/

From individual to collective behaviour Sixth International conference on Cellular Automata for Research and Industry October 25-27, 2004 Scope Local organising     committee Invited speakers ... News : movies now online ! Date: Location: October 25 - 27, 2004 University of Amsterdam, Science Park Amsterdam, The Netherlands Scope of the conference: Cellular Automata, in spite of their apparent simplicity represent a very powerful approach to study spatio-temporal systems in which complex phenomena build up out of many simple local interactions. They often provide solutions to real problems for which other, conventional approaches fail. John von Neumann, who is recognized as the father of cellular automata, would have been a hundred years old in 2004. ACRI 2004 wants to commemorate this important date by inviting researchers to submit contributions related to von Neumann's work or to the emergence of organisation in systems in which collaboration between components wins over the individual behaviour. The goal of this conference is to collect contributions concerning Cellular Automata in various fields such as theory, implementations and applications.

100. 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. http://digitalphysics.org

"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"... Contents 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 Contact Last updated: June 7 th , 2005, by Joel Dobrzelewski – email: joel@digitalphysics.org

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