
	Where results make sense

Topic: Rule 110 cellular automaton

Related Topics

The Price Is Right

Zamenhof

Kim Swales

Albert Einstein

Magnus Hirschfeld

Crohns disease

Tiber River

Isle Royale National Park

Fumimaro Konoye

Scottish Gaelic language

Paramaribo

Grand Duke

Jenny Thompson

Sam Rivers

Benjamin Britten

	Reflections on Stephen Wolfram's 'A New Kind of Science'
		A cellular automaton is a simple computational mechanism that, for example, changes the color of each cell on a grid based on the color of adjacent (or nearby) cells according to a transformation rule.
		Wolfram's primary observation that a Class 4 cellular automaton quickly produces apparent randomness (despite its determinate process) is consistent with the tendency towards randomness that we see in Brownian motion, and that is implied by the second law.
		Rule 110 states that a cell becomes white if its previous color and its two neighbors are all fl or all white or if its previous color was white and the two neighbors are fl and white respectively; otherwise the cell becomes fl.
	www.kurzweilai.net /articles/art0464.html?printable=1 (6928 words)

	Rule 110 cellular automaton
		The rule 110 cellular automaton is a one-dimensional two-state cellular automaton with the following rule table:
		Rule 110, like the Game of Life, exhibits what Stephen Wolfram calls "Class 4 behavior," which is neither completely random or completely repetitive.
		This is an interesting result because Rule 110 is an extremely simple system, simple enough to suggest that naturally occurring physical systems may also be capable of universality—and hence questions about them will often be undecidable.
	www.xasa.com /wiki/en/wikipedia/r/ru/rule_110_cellular_automaton.html (254 words)

	Is the Universe a Computer? - The New York Review of Books
		Rule 110 dictates that a cell in one row is left white if the three neighboring cells in the row above are all fl or all white or fl-white-white, and otherwise it is made fl.
		There are cellular automata with more than two colors, or with coloring rules like the Game of Life that change the colors of cells in more than one row at a time, or with cells in more than two dimensions.
		The program for the calculation and the data to be used would be fed into a rule 110 cellular automaton as a pattern of fl cells in the top row, and the answer would appear as a pattern on a lower row.
	www.nybooks.com /articles/15762 (5023 words)

	Rule 110
		Rule 110 is an one-dimensional cellular automaton of order (2,1) where k=2 and r=1 (set states and neighborhood radius respectively).
		At the beginning of the 90's Matthew Cook resolves the conjecture of Wolfram demonstrating that Rule 110 is universal [2, 18].
		This result has an outstanding importance within the history and the theory of cellular automata, because it is the simplest and the smallest cellular automaton fulfilling the characteristics established by John von Neumann.
	uncomp.uwe.ac.uk /genaro/Rule110.html (1214 words)

	Read This: A New Kind of Science
		A rule must specify, given the colors of a cell and its neighbors, the new color of the cell.
		Despite starting with total order, Rule 30 rapidly produces apparent randomness (at least on the right side of the picture), while Rule 110 quickly moves from randomness to a steady background state with bizarre particles moving across it and interacting.
		In some cases, such as Rule 30, it would be hard to describe what is going on by looking at it on a large scale and formulating equations, despite the simplicity of the rule.
	www.maa.org /reviews/wolfram.html (2708 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 Miscellanea - A repository with cellular automata related papers, lectures and software concentrating on Rule 110 by Harold V. McIntosh.
		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 (1031 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)

	Cellular Automaton...Artilifes.com
		A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory and mathematics.
		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 (fl and white), and the neighbors of a cell are the 8 squares touching it.
		Similarly, the rule 110 CA derives its name from 01101110, which is the binary representation of the decimal number 110.
	www.artilifes.com /cellularautomaton.html (1600 words)

	Historical Notes: History [of universal 1D cellular automata]
		The fact that 1D cellular automata can be universal was discussed by Alvy Ray Smith in 1970 - who set up an 18-color nearest-neighbor cellular automaton rule capable of emulating Marvin Minsky’s 7-state 4-color universal Turing machine (see page 706).
		In 1989 Kristian Lindgren and Mats Nordahl constructed a 7-color nearest-neighbor cellular automaton that could emulate Minsky’s 7,4 universal Turing machine, and showed that in general a rule with s + k + 2 colors could emulate an s-state k-color Turing machine (compare page 658).
		Following my ideas about class 4 cellular automata I had come by 1985 to suspect that rule 110 must be universal.
	www.wolframscience.com /reference/notes/1115c (524 words)

	NetLogo Models Library: CA 1D Rule 110
		A cellular automaton (aka CA) is a computational machine that performs actions based on certain rules.
		Although the rules are very simple, extremely complex patterns emerge in Rule 110.
		The first cellular automaton was conceived by John Von Neumann in the late 1940's for his analysis of machine reproduction under the suggestion of Stanislaw M. Ulam.
	ccl.northwestern.edu /netlogo/models/CA1DRule110 (1077 words)

	ImmInst.org -> Rule 110, Cellular Automata, Fibonacci phyllotaxis
		Rule 110 sounded intrigueing as Wolfram claimed that it is Universal and may be one of the rules that nature uses as a building block algorithm.
		This may be in fact true, that all rules of sub-atomic particles or string particles are following some very basic rules that lead to all of the emergence and patterns we see in the universe and throughout nature.
		The attached paper discusses cellular automata as being a good modeling technique at the cellular level where there are large populations of like cells.
	www.imminst.org /forum/index.php?act=ST&f=217&t=12416&s= (486 words)

	Cellular automaton Summary
		In many instances the behavior of a cellular automaton may not be theoretically obvious, and may have to be determined by simulation.
		A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology.
		Rule 30 was originally suggested as a possible stream cipher for use in cryptography.
	www.bookrags.com /Cellular_automaton (3999 words)

	1D Cellular Automaton (Site not responding. Last check: )
		One of the simplest cellular automata are one dimensional ones and even simpler are 1D cellular automata with only 2 states and rules involving only two neighbours.
		For this I have programmes a simple program, which calculates a Rule 110, with special initial conditions and a finite width: The cells are set to 11111000100110, concatenated over the whole width and with random cell-changes to 0 or 1 at a low rate.
		And the automaton wraps at the end to the start and vice-versa, because I think then it is easier to set-up the input and parse the output from a calculation.
	www.frank-buss.de /automaton/onedimension.html (208 words)

	cage
		The Map is the high-level class that the Automaton uses in order to do operations on the cellular network, intended to be a mixing of a Topology and a Neighborhood.
		There is no restriction that an Automaton must house exactly one map; for an agent-based automata it might store none, or for interacting automata overlaid on top of each other it might store several.
		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)

	Color Images from A New Kind of Science
		Evolution of a continuous cellular automaton with rule based on addition.
		A block cellular automaton conserving the number of color cells, but showing rapid randomization.
		More steps in the rule 110 cellular automaton pattern used in the cover image for the book.
	www.wolframscience.com /downloads/colorimages.html (611 words)

	rule 110 - Adwords Research by Velocityscape
		Note that of the 8 cases in the basic rule for rule 110, only one differs from rule 102 -- which is a simple additive rule obtained by reflecting rule...
		For example, if we have a Rule 110 CA, and the current cell is yellow and its left...
		Rules of Procedure of the European Parliament - Rule 110
	www.googspy.com /SearchTerm.aspx?id=8126 (284 words)

	Rule 110 cellular automaton - Education - Information - Educational Resources - Encyclopedia - Music
		Rule 110 cellular automaton - Education - Information - Educational Resources - Encyclopedia - Music
		Localized structures appear and interact in various complicated-looking ways.
		This means they may not be amenable to closed-form mathematical solutions.
	www.music.us /education/R/Rule-110-cellular-automaton.htm (450 words)

	Collection of Reviews of Wolfram's A New Kind of Science, Etc...
		Below you will find links to more reviews than you will care to read of Stephen Wolfram's book A New Kind of Science and links to some related articles.
		Who first had the idea that the universe is a cellular automaton?
		LEGAL ACTION taken by Wolfram regarding the proof by Matthew Cook of the universality of the rule 110 cellular automaton.
	www.math.usf.edu /~eclark/ANKOS_reviews.html (742 words)

Try your search on: Qwika (all wikis)