
	Where results make sense

Topic: Cellular automaton

Related Topics

Garden of Eden pattern

Undecidable

Cryptography

Konrad Zuse

Moose

Blackbird

Jane Goodall

Highlife

	Tables of Cellular Automaton Properties (1986)
		The complete evolution of such a cellular automaton can be represented by a finite diagram which shows the possible transitions between these states.
		Such transient phenomena are a manifestation of irreversibility in the cellular automaton evolution.
		Some finite cellular automata, such as rule 13, are reversible, so that their state transition diagrams contain no transients, and all states are on cycles.
	www.stephenwolfram.com /publications/articles/ca/86-caappendix/14/text.html (467 words)

	Universality and Complexity in Cellular Automata (1984)
		For cellular automata with translation invariant initial probability measures, stronger constraints may be obtained (analogous to those for ``stationary'' processes in communication theory [8]).
		Notice that the spatial entropy of a cellular automaton configuration may be considered as the temporal entropy of a pure shift mapping applied to the cellular automaton configuration.
		The ratio of temporal to spatial entropy is thus bounded by the maximum propagation speed in the cellular automaton.
	www.stephenwolfram.com /publications/articles/ca/84-universality/5/text.html (0 words)

	Cellular Automaton (Site not responding. Last check: )
		Cellular automata are the simplest models of spatially distributed processes.
		Cellular automata were invented in the 1940's by the mathematicians John von Neuman and Stanislaw Ulam, while they were working at the Los Alamos National Laboratory in northern central New Mexico.
		Despite the simplicity of the rules governing the changes of state as the automaton moves from one generation to the next, the evolution of such a system is complex indeed.
	www.exploratorium.edu /complexity/CompLexicon/automaton.html (196 words)

	Color Images from A New Kind of Science
		Evolution of a continuous cellular automaton with a rule based on multiplication.
		A 2D cellular automaton yielding a roughly circular pattern.
		A 16-color cellular automaton constructed to generate the prime numbers.
	www.wolframscience.com /downloads/colorimages.html (0 words)

	1D Cellular Automaton: Mathematics: Stilldreamer
		A cellular automaton can be seen as a set of conditions which evolves through time according to certain rules.
		Cellular automata, aside from being visually pleasing, exhibit interesting phenomena that have been studied by many mathematicians; for example, starting from very simple initial conditions and using simple rules, some cellular automata yield complex—and often seemingly random—behaviour while others model physical phenomena.
		The Macromedia Flash animation presented here is a basic cellular automaton: it is a one dimensional, two colour, nearest neighbour cellular automaton, which is also known as the elementary cellular automaton.
	www.stilldreamer.com /mathematics/1d_cellular_automaton (547 words)

	Open Directory - Computers: Artificial Life: Cellular Automata
		Cellular Automata and the Edge of Chaos - David J. Eck's Java-illustrated introduction to 1-dimensional cellular automata.
		Cellular Automata Laboratory - An extendable DOS/Windows application for exploring cellular automata, accompanied by a thorough user guide; by Rudy Rucker and John Walker.
		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.
	www.dmoz.org /Computers/Artificial_Life/Cellular_Automata (1056 words)

	Life Lexicon (C)
		:cellular automaton A certain class of mathematical objects of which Life is an example.
		The state of the cellular automaton evolves in discrete time, with the state of each cell at time t+1 being determined by the state of its neighbourhood at time t, in accordance with the transition rule.
		:colorized Life A cellular automaton which is the same as Life except for the use of a number of different ON states ("colours").
	www.argentum.freeserve.co.uk /lex_c.htm (2257 words)

	cage
		An Automaton knows how to update itself each turn; this is the primary class which does the busy work of processing a cellular automaton system.
		A synchronous automaton is one in which all processing is done simultaneously -- that is, during the processing of an update, the transitions of any given cell will not affect the transition of any other cell.
		An initializer is used to set the initial states of an automaton map to the desired settings before the automaton begins.
	www.alcyone.com /software/cage (1457 words)

	Stephen Wolfram: A New Kind of Science--Current Bibliography
		Hill, L. "Cellular Automata Mode of the Transverse Fragmentation Wave Structure in Superheated-Liquid Evaporation Waves." Poster presented at NKS 2003, Boston, MA, 2003.
		Narbel, P. "Qualitative and Quantitative Cellular Automata from Differential Equations." In Cellular Automata, Proceedings.
		Obando, R. "2D and 3D Visualization of Cellular Automaton Rules." Poster presented at NKS 2003, Boston, MA, 2003.
	www.wolframscience.com /reference/bibliography.html (0 words)

Try your search on: Qwika (all wikis)