41. Cellular Automata FAQ cellular automata FAQ. NonJava version Expand this node. Definitions -and general references on cellular automata;. What are cellular automata (CA)? http://cafaq.com/

Cellular Automata FAQ Non-Java version Edited by Tim Tyler . Originally edited by Howard Gutowitz var image_directory = "lib/tree/images/"; Autobiography About this FAQ; What is the status of the Cellular Automata FAQ? Will there be a text version of the FAQ? Is the original FAQ still available? Why are Java applets stealing my CPU cycles? ... Generalities Definitions - and general references on cellular automata; What are Cellular Automata (CA)? How do I contribute bibliographic material to the FAQ? Where are cellular automata discussed? What should I work on in CA for my Ph.D. thesis? ... Cellular automata software Packages for running cellular automata - and related systems; What general-purpose CA simulators are available? What simulators for the Game of Life are available? How can I make CA simulations run fast? What other CA software is available? ... Cellular automata hardware Running cellular automata in hardware; What hardware implementations exist for CA? Are there any simulators for CAM? What about running CA's on parallel or distributed machines? References ... Conway's game of life All about Conway's Game of Life [life-specific software here]; Where do I start?

42. Pierre Tisseur Mathematical aspects of cellular automata. http://pierre.tisseur.free.fr

Pierre Tisseur's Home Page Reserch Interests Papers Book Java Software ... Search Engines Ph.D (Mathematics), University of Marseille (1999) Research Assistant University of Evry (France) CV + research project (in French) mailto:tisseur@genopole.cnrs.fr Research Interests: Ergodic theory, Dynamical Systems Cellular Automata ( Deterministic and Probabilistic) BioInformatics (DNA Statistics Micro array analysis, Data Analysis Short Mathematics history of Cellular automata (in French) Papers Nonlinearity 13 (2000) Computational Biology and Chemistry 28 (2004) Ann. Inst. Henri Poincarré (section Proba. and Statistics) 36 (2000) (A didactic note 2003) Book From cristal to chaos (World Scientific Publishing 2000) Editor with (J.m Gambaudo, P. Hubert, S. Vaienti) Java Software Teaching Evry University (Informatics, Java, DataBase) Amiens University (Mathematics, Analysis, Algebra ) Aix-Marseille II University (Mathematics) Links Nonlinearity Elsevier Ann. Institut Henri Poincarré. NCBI Genomic Biology (Genetic sequences) Cellular automata software to explore the edge of chaos ... Cellular automata Personal Home Page of Mirek Wojtowi Search Engines Google:

43. Homepage Alexander Schatten - Portal 200503-08 cellular automata and Image Processing. Jürgen Platzer developedfor the Neural Computation lecture an excellent piece of software, http://www.schatten.info/

44. Sean Erik O'Connor - Home Page And Free Mathematical Software. Free software for primitive polynomial computation, CRC code generation, coding and decoding, parsing theory and cellular automata. http://www.seanerikoconnor.freeservers.com/

I'm a software design engineer with experience in algorithm design, image processing, communications engineering, and real time embedded systems from Silicon Valley, U.S.A. I've developed under UNIX and Windows platforms in Java, C++ and C. My educational background is in pure and applied mathematics, classical and quantum physics and studio art. I enjoy innovation and applying theory to solving practical problems. Please see my resume for details. Professional Interests For fun, I design and publish specialized mathematical software including programs for primitive polynomial computation, CRC code generation, coding and decoding, and cellular automata. All source code is copylefted under the GNU General Public License and comes with extensive comments and complete technical documentation. Other Interests I enjoy reading science fiction and fantasy, drawing in pencil and painting in acrylic, listening to music, and doing hobby electronics. Hyperlinks E-mail me Our civilization has become totally dependent on cheap petroleum for food production, transportation and industry. But the cheap oil is running out starting

45. Homepage Alexander Schatten - Information / Tutorials From the theoretical point of view, cellular automata (CA) were Whereas theone dimensional CA has the big advantage, that it is very easy to visualize. http://www.schatten.info/info/ca/ca.html

46. Brothers Technology - Research And Publications By Harlan Brothers Director of technology for a primary school. A discussion of relationships between e, pi, and Euler's Gamma. Projects and research involving an improved approximation to e, as well as fractals, cellular automata, and mathematics education. http://www.brotherstechnology.com/math/index.html

Main Menu Home Patents Research Contact Research Harlan Brothers, founder of Brothers Technology, has a long-standing interest in number theory and its applications. He has discovered formulas and relationships relating to the constants e pi , and Euler's gamma . His most recent paper entitled " Improving the Convergence of Newton's Series Approximation for e " includes the fastest known methods for computing this article fundamental constant of nature. The article appears in the January 2004 issue of the College Mathematics Journal Here is a presentation on the subject from the Third Annual Citizen Science Conference The presentation currently requires Internet Explorer. Mr. Brothers teaches at The Country School where he serves as Director of Technology . For the last five years he has been working with Michael Frame and Benoit Mandelbrot at Yale University to explore the use of fractal geometry in mathematics education . Recent projects at Yale include a workshop on the subject of fractal musical composition and analysis . Here is a brief introduction to fractals in PDF format [1.7MB].

47. Evolving Cellular Automata Group - The Santa Fe Institute Welcome to the Evolving cellular automata (EvCA) Group Home Page Evolvingcellular automata with genetic algorithms; Population dynamics; Coevolution http://www.santafe.edu/projects/evca/

J. Crutchfield Computational Mechanics Dynamics of Learning Evolving Cellular Automata ... Funding Welcome to the Evolving Cellular Automata (EvCA) Group Home Page The EvCA group is based at the Santa Fe Insitute (SFI) and at the Los Alamos National Laboratory (LANL) at the Biophysics Group The overall research done by the EvCA group is primarily motivated by the question: "How does evolution produce sophisticated emergent computation in systems composed of simple components limited to local interactions?" To try to find answers to this question, genetic algorithms are used to evolve cellular automata to perform computational tasks that require global information processing. In studying the results of these computer simulations, many more, related questions have sprung up, ranging from questions about the relation between pattern formation and information processing to questions about population dynamics and coevolution. Follow the links in the list below to find out more about these research projects, and how they relate to each other. Evolving cellular automata with genetic algorithms Population dynamics Coevolution Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 87501

48. Alexander Holroyd's Home Page University of British Columbia. Research interests Probability theory, including cellular automata, percolation, matching, coupling. http://www.math.ubc.ca/~holroyd

Alexander E. Holroyd E m ai l: ho lr oyd a t ma th do t ubc d ot ca Telephone/Fax: Office: Math Annex Mailing Address: Department of Mathematics University of British Columbia , 121 - 1984 Mathematics Rd, Vancouver , BC V6T 1Z2, CANADA Bootstrap Percolation Stable Marriage of Poisson and Lebesgue B-M-L Traffic Model Math 420/507 Math 608D Probability Seminar UBC Probability ... Change Ringing Research Interests: Probability theory, with emphasis on discrete spatial models, including cellular automata, percolation, matching, coupling. Papers: Tail Bounds for the Stable Marriage of Poisson and Lebesgue . Preprint. A Stable Marriage of Poisson and Lebesgue . Preprint. [Version without pictures here The Jammed Phase of the Biham-Middleton-Levine Traffic Model Electronic Communications in Probability , 2005, Vol 10, Paper 17, 167-178. Universal Finitary Codes with Exponential Tails . Preprint. Extra Heads and Invariant Allocations . The Annals of Probability. 2005, , Vol 33, no 1, 31-52. Integrals, Partitions, and Cellular Automata . Transactions of the American Mathematical Society, 2004, Vol 356, 3349-3368. Trees and Matchings from Point Processes Electronic Communications in Probability , 2003, Vol 8, Paper 3, 17-27.

49. EvCA Papers Evolving cellular automata with Genetic Algorithms. Revisiting the Edge of ChaosEvolving cellular automata to Perform Computations Dynamics, Computation http://www.santafe.edu/projects/evca/evabstracts.html

EvCA Papers This page contains a list of all papers relating to the EvCA project. The papers are grouped according to main research topic. There is also a category for Ph.D. dissertations written by (former) graduate students in the EvCA group. Click on a reseach topic in the list below or scroll down the page to find the paper(s) of your interest. Click on the title of a paper to see the complete reference information, the abstract, and a link to a postscript version of the respective paper. Please contact us if you have trouble downloading any of these papers. In some cases we might be able to send a hardcopy. Evolving Cellular Automata with Genetic Algorithms Computational Mechanics Population Dynamics Coevolution ... Ph.D. Dissertations Evolving Cellular Automata with Genetic Algorithms Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations Dynamics, Computation, and the "Edge of Chaos": A Re-Examination Evolving Cellular Automata to Perform Computations: Mechanisms and Impediments The Evolution of Emergent Computation ... The Evolutionary Design of Collective Computation in Cellular Automata Computational Mechanics Pattern Discovery and Computational Mechanics Population Dynamics Finite Populations Induce Metastability in Evolutionary Search Statistical Dynamics of the Royal Road Genetic Algorithm Optimizing Epochal Evolutionary Search: Population-Size Independent Theory Optimizing Epochal Evolutionary Search: Population-Size Dependent Theory ... Metastable Evolutionary Dynamics: Crossing Fitness Barriers or Escaping via Neutral Paths?

50. Cellumat3D Open source tool for simulating and exploring cellular automata in 3D space http://cellumat3d.sourceforge.net/

A tool for simulating and exploring 3D cellular automata About Cellumat3D Screenshots Project Page Download Cellumat3D is a tool for simulating and exploring cellular automata in 3D space. The application uses OpenGL and is fast enough to give a good impression why cellular automata are regarded as part of artificial life research. Features: fast, efficient memory usage effectively unbound universe due to tile-based memory management free flight-simulator-like movement through universe support for editing/saving/loading rulesets Platforms: Linux, Windows Links: Introduction to cellular automata, its uses and artificial life research Wikipedia entry about cellular Automata Conway's Game of Life , the most famous cellular automaton Articles by Stephen Wolfram on cellular automata Overview of 3D cellular automata ressources on the web A period-4 oscillator

51. Caos A Java applet running onedimensional cellular automata; by Martin Schaller. http://members.surfeu.at/tim2/caos/caos.html

alt="Your browser understands the APPLET> tag but isn't running the applet, for some reason." Your browser is completely ignoring the APPLET> tag! caos One-Dimensional Cellular Automaton Simulation a Java 1.1 capable browser is required to see the applet alt="Your browser understands the APPLET> tag but isn't running the applet, for some reason." Your browser is completely ignoring the APPLET> tag! starts caos in a resizable window description link rule source ... X

52. Automatous Monk: Music From Simple Programs Uses cellular automata to generate musical pieces. Java. http://www.automatous-monk.com

Automatous Monk: Music from simple programs Automatous Monk was a composer and pianist. He was born in Duluth, Minnesota in 1912 and died in 1964 in Minneapolis. He made his living as a jazz pianist in bars and clubs mostly in the Twin Cities area. Legend has it that he met the mathematician Alan Turing while visiting a niece in Princeton, New Jersey. (Turing was studying at Princeton University at the time.) Monk and Turing met by chance in a coffee shop in Princeton. Turing explained to Monk the concept of Turing machines, which are basically the equivalent of computer programs. Monk, who had a mathematical bent, despite a lack of much formal training, picked up on Turing's ideas quickly and wondered whether they could be applied to music composition. Working in a spare bedroom in his house in Duluth, Monk painstakingly wrote simple Turing machine and cellular automata programs that generate musical melodies even though he had no computer to run these programs. These programs (written in Big Chief tablets) were later found in his attic by his great-nephew, Paul Reiners, a programmer, and translated into Java. AM (Automatous Monk) Radio Turn off that smooth 'jazz' FM nonsense and listen to some AM Radio for a change, Automatous Monk Radio, that is.

53. Cellular Automata And Complexity: Collected Papers cellular automata and Complexity Collected Papers by Stephen Wolfram Aremathematical equations the best way to model nature? For many years it had been http://www.stephenwolfram.com/publications/books/ca-reprint/

Publications by Stephen Wolfram Books Cellular Automata and Complexity: Collected Papers by Stephen Wolfram Table of Contents Are mathematical equations the best way to model nature? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer programs. Wolfram made a detailed study of a class of such models known as cellular automata, and discovered a remarkable fact: that even when the underlying rules are very simple, the behavior they produce can be highly complex, and can mimic many features of what we see in nature. And based on this result, Wolfram began a program to develop what has become A New Kind of Science The results of Wolfram's work found many applications, from the so-called Wolfram Classification central to fields such as artificial life, to new ideas about cryptography and fluid dynamics. This book is a collection of Wolfram's original papers on cellular automata and complexity. Some of these papers are widely known in the scientific community; others have never been published before. Together, the papers provide a highly readable account of what has become a major new field of science, with important implications for physics, biology, economics, computer science and many other areas. Published (1994): ISBN 0-201-62716-7 (hardcover) ISBN 0-201-62664-0 (paperback) Contact

54. JavaScript Simulation Of Conway's Game Of Life Simulation of general cellular automata and Conway's Game of Life implemented entirely in JavaScript. http://www.posi.net/software/automata/

These are cellular automata simulations I wrote in JavaScript one weekend. As of November 9th, 1999, these are the only such simulations written in JavaScript on the web. Which is a fact that doesn't really surprise me as JavaScript is dog slow and the browser compatibility issues are a nightmare. So why did I do it? Because it was there. Actually, JavaScript isn't a bad language for writing the simulations, it provides object orientation, automatic type conversion, and easy access to HTML elements (great for displaying images). It just isn't a good environment for running the simulations :). The simulations are notably slower than ones written in "real" languages. The scripts in these pages require a web browser which implements version 1.2 or higher of the Javascript language as well as the Document Object Model . All scripts are standards-compliant, not browser-compliant. If your browser is not also standards-compliant, then perhaps you should consider getting one that is :). For these scripts, the relavant standards are HTML 2.0 or higher, the EMCA-262 , and the

55. Stephen Wolfram: Articles On Cellular Automata Universality and Complexity in cellular automata (1984). Preface to CellularAutomata Proceedings of an Interdisciplinary Workshop (1984) http://www.stephenwolfram.com/publications/articles/ca/

Publications by Stephen Wolfram Articles Stephen Wolfram: Articles on Cellular Automata Cellular Automata as Simple Self-Organizing Systems Statistical Mechanics of Cellular Automata Cellular Automata ... Cellular Automaton Supercomputing Note: Since 1987 Stephen Wolfram's intellectual efforts have primarily been described in his books on Mathematica and A New Kind of Science rather than academic articles. Contact

56. A New Strategy For Random Number Generation MAG is an algorithm (cellular automata) that creates an apparently random stream of numbers. It is very simple and very fast.There are arguments that the MAG algorithm can be easily transformed in the NP class of problems which enables a complexitytheoretic approach to cipher design using MAG. http://www.geocities.com/radence_v

MAG HOME PAGE The paper and the source code behind the new idea can be downloaded here (mag_v_20.zip). My email is radence_v@yahoo.com if more info is required.

57. Dr.Cell Cellular Automata Simulator A tool for simulating uniform or nonuniform cellular automata for a variety ofneighborhood models, implemented in Scheme (a dialect of Lisp) using PLT s http://student.vub.ac.be/~nkaraogl/drcell/drcell.htm

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: The Game of Life Wireworld Sierpinski's Triangle FishTank ... A Population Model for Rabbit's, Turtles and Carrots (Non-Uniform CA) 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.

58. Cellular Automaton - Wikipedia, The Free Encyclopedia A cellular automaton (plural cellular automata) is a discrete model cellular automata are often simulated on a finite grid rather than an infinite one. http://en.wikipedia.org/wiki/Cellular_automata

Cellular automaton From Wikipedia, the free encyclopedia. (Redirected from Cellular automata A cellular automaton (plural: cellular automata ) is a discrete model studied in computability theory mathematics , and theoretical biology . It consists of an infinite, regular grid of cells , each in one of a finite number of states . The grid can be in any finite number of dimensions. Time is also discrete, and the state of a cell at time t is a function of the state of a finite number of cells called the neighborhood at time t-1 . These neighbors are a selection of cells relative to some specified, and do not change (Though the cell itself may be in its neighborhood, it is not usually considered a neighbor). Every cell has the same rule for updating, based on the values in this neighbourhood. Each time the rules are applied to the whole grid a new generation is produced. One example of a cellular automaton (CA) would be an infinite sheet of graph paper, where each square is a cell, each cell has two possible states (black and white), and the neighbors of a cell are the 8 squares touching it. Then, there are 2 = 512 possible patterns for a cell and its neighbors. The rule for the cellular automaton could be given as a table. For each of the 512 possible patterns, the table would state whether the center cell will be black or white on the next time step. This is an example of a two dimensional cellular automaton. See

59. Hiji Bij Bij Describes a stream cipher devised by Palash Sarkar and the Cryptology Research Group at the India Statistical Institute. Like many new stream ciphers, it has two parts to its state, one part updated linearly and one part updated nonlinearly. The linear part is implemented as cellular automata. The cipher can run in a self-synchronizing mode. The C source code is in this postscript document. http://eprint.iacr.org/2003/014.ps

60. Center For Complex Systems Research Founded in 1986, the Center for Complex Systems Research studies systems that display adaptive, selforganizing behavior and systems that are usually characterized by a large throughput, such as turbulent flow, lightning, and the flow of information through the internet. Models and techniques drawn from nonlinear dynamics and chaos, neural nets, cellular automata, artificial life, and genetic algorithms are then developed to describe these complex systems. A collection of technical reports and scientific publications of CCSR researchers is available. http://www.ccsr.uiuc.edu

Center for Complex Systems Research University of Illinois ABOUT PEOPLE RESEARCH EDUCATION SEMINAR/SYMPOSIUM ... RECENT PUBLICATIONS The Center for Complex Systems Research (CCSR) studies systems that display adaptive, self-organizing behavior and systems that are usually characterized by a large throughput, such as turbulent flow, lightning, and the flow of information through the internet. To describe these complex systems, we develop models and techniques drawn from nonlinear dynamics and chaos, neural nets, cellular automata, artificial life, and genetic algorithms. Each year CCSR organizes and hosts the conference Understanding Complex Systems The Center for Complex Systems Research has a rich history. Founded in 1986 by Stephen Wolfram, the center was later led by Norman Packard and E. Atlee Jackson. A collection of technical reports and scientific publications of CCSR researchers ranging from cellular automata to entrainment control of chaos, experimental studies of turbulent flows, chaotic electronic circuits, and fractal agglomeration patterns is available. The research at CCSR is supported by the National Science Foundation Grant No. NSF PHY 01-40179, NSF DMS 03-25939 ITR, and NSF DGE 03-38215

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