http://wiki.karljones.com/index.php?action=history&feed=atom&title=Rule_90 2026-10-23T16:44:20Z Revision history for this page on the wiki MediaWiki 1.24.2 http://wiki.karljones.com/index.php?title=Rule_90&diff=18754&oldid=prev 2016-09-23T13:41:28Z

<p>Created page with &quot;&#039;&#039;&#039;Rule 90&#039;&#039;&#039; is an <a href="/index.php/Elementary_cellular_automaton" title="Elementary cellular automaton">elementary cellular automaton</a> based on the <a href="/index.php/Exclusive_or" title="Exclusive or">exclusive or</a> function. == Description == It consists of a one-dimensional array of cells, each of whic...&quot;</p> <p><b>New page</b></p><div>'''Rule 90''' is an [[elementary cellular automaton]] based on the [[exclusive or]] function.<br /> <br /> == Description ==<br /> <br /> It consists of a one-dimensional array of cells, each of which can hold either a 0 or a 1 value; in each time step all values are simultaneously replaced by the exclusive or of the two neighboring values.<br /> <br /> Martin, Odlyzko &amp; Wolfram (1984) call it &quot;the simplest non-trivial cellular automaton&quot;, and it is described extensively in [[Stephen Wolfram]]'s 2002 book ''A New Kind of Science''.<br /> <br /> When started from a random initial configuration, its configuration remains random at each time step; however, any configuration with only finitely many nonzero cells becomes a replicator that eventually fills the array with copies of itself.<br /> <br /> == See also ==<br /> <br /> * [[Cellular automaton]]<br /> * [[Complexity]]<br /> * [[Elementary cellular automaton]]<br /> * [[Exclusive or]]<br /> * [[Rule 30]]<br /> * [[Rule 110]]<br /> * [[Rule 184]]<br /> <br /> == External links ==<br /> <br /> * [https://en.wikipedia.org/wiki/Rule_90 Rule 90] @ Wikipedia<br /> <br /> <br /> [[Category:Algorithms]]<br /> [[Category:Cellular automata]]<br /> [[Category:Complexity]]</div>

Karl Jones