Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Cellular automata

Related Topics

In the News (Mon 19 Aug 19)

  Cellular Automata Laboratory
The most important near-term application of cellular automata will be to commercial computer graphics; in five years you won't be able to watch television for an hour without seeing some kind of CA.
Three other key applications of cellular automata will be to simulation of biological systems (artificial life), to simulation of physical phenomena (heat-flow and turbulence), and to the design of massively parallel computers.
Advanced users can customize the cellular automata simulator by writing custom evaluators in assembly language for DOS or Windows, or as a DLL written in C for the Windows-based simulator.
www.fourmilab.ch /cellab   (1315 words)

  Cellular Automata
Cellular automata models of dynamic phenomena represent in silico experiments designed to assess the effects of competing factors on the physical and chemical properties of solutions and other complex systems.
Cellular automata is thus considered as providing an exploratory method for the analysis of dynamic phenomena and the discovery and understanding of new, unexpected phenomena.
The cellular automata dynamics were successfully able to model expected chromatographic behavior except in a few cases where the number of cells was not large enough to provide an average value reflective of the molecular situation.
lansbury.bwh.harvard.edu /cellular_automata.htm   (14094 words)

 Levitated | Cellular Automata Worm | Flash MX open source
The CA Worm is an expanding construction of a one dimensional cellular automata.
Cellular automata are discreet dynamical systems with simple construction but complex emergent behavior.
A similar cellular automata exists as a continually evolving interactive ring.
www.levitated.net /daily/levCAWorm.html   (126 words)

 Cellular Automata
Public key cryptography using cellular automata - bibliography
[Interference] - interference patterns in a cellular automaton
Spiney membranes - model of membranes with spinesl
cell-auto.com   (49 words)

 Automata - Agents of Life Within
This denotes an automata between states 2 and 3 - at the edge of chaos, as we call it.
The molecular protein sub-units of these tubules seem to demonstrate automata behaviour, suggesting that the basis of life may indeed be such forms of organisation.
We have largely been considering automata as the basis for life, but recall that we started with an inorganic pattern of squares to which we applied the rules externally.
www.calresco.org /automata.htm   (2025 words)

Cellular automata are a class of spatially and temporally discrete mathematical systems characterized by local interaction and synchronous dynamical evolution.
Cellular automata have been the focus of great attention over the years because of their ability to generate a rich spectrum of very complex patterns of behavior out of sets of relatively simple underlying rules.
It also presents a broad review of the speculative proposition that cellular automata may eventually prove to be theoretical harbingers of a fundamentally new information-based, discrete physics.
www.worldscibooks.com /chaos/4702.html   (456 words)

 Moshe Sipper, The Artificial Self-Replication Page
A cellular automaton consists of an array of cells, each of which can be in one of a finite number of possible states, updated synchronously in discrete time steps, according to a local, identical interaction rule.
The underlying model is that of a non-uniform cellular automaton in which the local update rule need not be identical for all grid cells (as is the case with the original CA).
For cellular automata models, a new method of automata input, called orientation insensitive input, was introduced and shown to increase the yield of self-replicating structures found.
www.cs.bgu.ac.il /~sipper/selfrep   (7469 words)

 Tutorials - Cellular Automata (VLAB)
The "cellular automaton" extends this analogy to provide a way of viewing whole populations of interacting "cells", each of which is itself a computer (automaton).
Cellular automata models of landscapes consist of fixed arrays in which each cell represents an area of the land surface.
To see how easily the cellular automaton idea can be brought to bear on real systems, consider a system whose states are of the form (s,t), where t denotes "time since fire burned out the cell" and stakes one of the values: "bare earth" (E), "grass" (G), "woodland" (W), and "closed forest" (F).
www.complexity.org.au /vlab/tutorials/ca   (1389 words)

 Historical Notes: History of cellular automata
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.
The particular cellular automaton he constructed in 1952-3 had 29 possible colors for each cell, and complicated rules specifically set up to emulate the operations of components of an electronic computer and various mechanical devices.
By the end of the 1950s it had been noted that cellular automata could be viewed as parallel computers, and particularly in the 1960s a sequence of increasingly detailed and technical theorems - often analogous to ones about Turing machines - were proved about their formal computational capabilities.
www.wolframscience.com /reference/notes/876b   (1653 words)

 Modern Cellular Automata Author
If a copy of the Modern Cellular Automata Java applet is placed in the same directory as the HTML document file then the cellular automata should start running as soon as the HTML document is opened.
The Modern Cellular Automata software distribution contains the Modern Cellular Automata applet, which may be freely reproduced so long as it is not modified, and all of the HTML and Javascript "source code" for Modern CA Author (this web page) and Modern CA AuthorXY.
The latest version of Modern Cellular Automata software may be downloaded from www.collidoscope.com/modernca/author.zip.
collidoscope.com /modernca/author/author.html   (179 words)

 Levitated | Cellular Automata Twist | Flash MX open source
The CA Twist is a one dimensional cellular automata wrapped around a rotating construct.
A similar cellular automata exists as an expanding static construction.
Given more computational resources (or a more efficient implementation), it would be nice to see the width of this CA expanded to 32 or even 64 bits.
www.levitated.net /daily/levCATwist.html   (219 words)

 Cellular Automata   (Site not responding. Last check: )
Cellular automata are extreamly simple computational systems that create interesting images which show some even more interesting behaviours.
These cellular automata images are a bunch of fl and white pixels that are built from the top down, where each scanline is based on the colour of the pixels on the scanline above it.
To generate your own cellular automata, and experiment with the 256 different rule sets, see the cellular automaton generator.
kidojo.com /~yebb/cellauto   (564 words)

 Nano-Cellular Automata
The minimum number of neighbors is two, but the cellular array is then effectively one dimensional, as its cells are strung in long chains.
Fredkin's 1974 cellular automata class at MIT; and it is the basis for this exploration.
Cellular automata made of zero-power (reversible) logic and optically driven constitute a nano-scalable technology which promises exceptional speed of computation.
swiss.csail.mit.edu /~jaffer/Cell   (856 words)

 Global Reversibility of Cellular Automata
Consider the one-dimensional Boolean cellular automata defined such that the new value of each cell is a fixed function of the current value of the cell and its two nearest neighbors.
The behavior of simple cellular automata in the forward and reverse directions can be used to illustrate, and perhaps even to model, some interesting ideas in physics.
Another interesting and suggestive phenomena arising from cellular automata loops is the potential for loop doubling, which is similar to slicing a Mobius strip down the middle to create a single strip with twice the length.
www.mathpages.com /home/kmath439/kmath439.htm   (2781 words)

 Introduction to cellular automata 01
There is a wealth of literature about cellular automata, as well as many Internet resources (you'll find some of them in the links section).
cellular automata are abstract constructions with quite complex properties not very accessible.
The first ones define the spatial structure of the automata network, that is its number of dimensions, the disposition of cells (squares, hexagons,… in a two dimensional automaton) and the type of neighbourhood determination.
www.rennard.org /alife/english/acintrogb01.html   (1611 words)

 Open Directory - Computers: Artificial Life: Cellular Automata   (Site not responding. Last check: )
Cellular Automata and the Edge of Chaos - David J. Eck's Java-illustrated introduction to 1-dimensional cellular automata.
Cellular Automata Tutorial - A cellular automata tutorial that covers the structure, behaviour and some applications of CA and offers a philosophical background as well; by Alexander Schatten.
Introduction to Cellular automata - (game of life, brian's brain...) available in PDF, illustrated with a program (CAV) and an applet which show the capability of a conway CA to manage boolean functions as part of a Turing machine(LogiCell).
dmoz.org /Computers/Artificial_Life/Cellular_Automata   (1046 words)

 Cellular Automata
The basis of my decision to examine cellular automata (CA) as a model for traffic was its logical parallelism to modeling human behavior through closed spaces.
Cellular Automata models are capable of representing individual vehicle interactions and relating these interactions to macroscopic traffic flow metrics, such as throughput, time travel and vehicle speed.
The all-important property of cellular automata, is that this function is defined discretely (a finite lookup table).
www.theory.org /complexity/traffic   (3683 words)

 Wolfram's 1D Cellular Automata
Then he relates automata to almost every scientific field, from biology to psychology to physics.
A cellular automaton is an algorithm for generating a set of cells, given another set of cells.
It will take many years to assess whether cellular automata provide a better model for phenomena that scientists now explain through other systems.
www.spss.com /research/wilkinson/Applets/automata.html   (613 words)

 Cellular Automata
The central 40-by-40 grid is the automata universe.
Cellular automata could reveal a lot about how the universe works and maybe even about how life began.
It is an implementation of a cellular automata that John Conway chose to call "The Game of Life." It simulates the birth, death, etc., of organisms based on certain rules.
www.aridolan.com /ad/CA.html   (725 words)

 Theory of Cellular Automata
Since the automata are using state configurations of a given template as their input source, the set of all possible configurations for a given template is isomorphic to the set of input symbols that the automata need recognize.
We are interested in studying how the behavior of cellular automata correlates with the choice of rule set and whether or not there is a sub-rule-space that lends itself to computational ability.
As ``computers themselves'', cellular automata use their starting configuration as the data which their transition function is to process.
www.theory.org /complexity/cdpt/html/node4.html   (3552 words)

 Amazon.com: Cellular Automata: Theory and Experiment (Special Issues of Physica D): Books: Howard Gutowitz   (Site not responding. Last check: )
Cellular automata, dynamic systems in which space and time are discrete, are yielding interesting applications in both the physical and natural sciences.
Current work on cellular automata may be viewed as revolving around two central and closely related problems: the forward problem and the inverse problem.
The role of cellular automata in computation theory is seen as a particularly exciting venue for exploring parallel computers as theoretical and practical tools in mathematical physics.
www.amazon.com /Cellular-Automata-Experiment-Special-Physica/dp/0262570866   (1200 words)

 Cellular automata and music
Cellular automata (CAs) -- a class of mathematical structures that evolve over time -- present an intriguing avenue for algorithmic music composition.
As with all elementary cellular automata, its definition, illustrated in Figure 4, is quite simple -- a small diagram defines it completely.
Approaches to the science of cellular automata can come from many angles and involve varying degrees of technical sophistication, from high school level to graduate level.
www-106.ibm.com /developerworks/java/library/j-camusic   (4252 words)

Cellular automata, of which Von Neumann's self-replicating automaton is just one example, also transmit information in an interesting manner.
Sequences, which one could make a strong case for labeling 'zero-dimensional cellular automata', have single numbers, which can be thought of as points, as their constituent elements, and propagate to form strings of numbers--lines.
Even in the automata with rules that are completely deterministic, different initial conditions and the length of time for which one iterated the rule of the automaton allow for great variety of output; witness the two images (Figure 3) from the Sierpinski rule.
www.dartmouth.edu /~matc/math5.pattern/FinalProject/Hoke.html   (6138 words)

 The Math Forum - Math Library - Cellular Automata   (Site not responding. Last check: )
Explorations of 0-, 1-, and 2-dimensional cellular automata; and applications of cellular automata to ecosystem modeling.
Cellular automata theses, reports of summer research, working papers, lectures, and articles, some in Spanish, many by Harold V. McIntosh.
Cellular automata (CA) are discrete space/time logical universes, obeying their own local physics according to given rules.
mathforum.org /library/topics/cellular_auto   (2129 words)

 Five Cellular Automata
The structure is thus that of a torus, although it is easier to think of a 2-dimensional plane in which an unlimited number of copies of the square array are reproduced next to, and above and below, each other (and each copy changes in the same way).
In each of these five automata the number of states is q (so that each cell is always in one of the states 1, 2,..., q).
An explanation of the workings of each of these cellular automaton, and how to explore them using the software, may be found by following the links above.
www.hermetic.ch /pca/pca.htm   (799 words)

 Cellular Automata
From a historical perspective it's worth noting that "cellular automata" (CA) have been in widespread use for many decades as a means of simulating complex physical phenomena.
However, there has been an increasing interest in these "frivolous" algorithms in the last few decades, leading to the idea that cellular automata may be important in their own right for the description of physical phenomena, independent of any correspondence which some of them may have with differential equations.
Incidentally, despite the efforts of "CA" enthusiasts to free cellular automata from their role as just a means of simulating differential equations, we still find that the requirement of locality is almost invariably imposed, by making the rules strictly functions of "neighboring" cells.
www.mathpages.com /home/kmath416/kmath416.htm   (4490 words)

 Self-organizing Cellular Automata   (Site not responding. Last check: )
The computation proceeds by having the cellular automata organize themselves into clerks, and then a stepwise simulation of the more powerful computer is performed.
Clerks are used here to give optimal parallel algorithms for a connected 1s problem on a cellular array, and a circle construction problem on a pyramid cellular automaton.
A paper utilizing clerks for a cellular automaton arranged as a mesh-connected computer, and one for a pyramid computer.
www.eecs.umich.edu /~qstout/abs/FOCS82.html   (439 words)

My original Cellular Automata Music application was developed 1988 - 1990 and was used in presenting a paper at the International Computer Music Conference, 1990, Glasgow.
The new version of CELLULAR AUTOMATA MUSIC (2003 - 2004) is written in Cocoa, Apple's object-oriented language, using Objective-C and C. The user interface, built with Interface Builder, is designed for user interaction with the running application.
The size of the main window cannot be changed so it is necessary to set the display resolution to 1024 X 768 and place the dock at the right side of the screen to achieve correct operation of the application.
comp.uark.edu /~dmillen/cam.html   (749 words)

 Fun with Cellular Automata
Cellular automata are simple rules that are applied to a grid of cells, or the pixel values of an image.
Cellular Automata by their very nature are dynamic, acting out over time, so a single image snapshot can't capture the dynamic effects that you experience watching them play out over time.
When I ported SimCity to Unix, I had to write an efficient tile display engine, so when it was done, I tested it by running cellular automata in the city matrix, and displaying the cells as colorful 16x16 tiles in the map window.
www.art.net /Studios/Hackers/Hopkins/Don/art/cell.html   (1515 words)

Try your search on: Qwika (all wikis)

  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.