Stephen Wolfram's: A New Kind of Science | Online
Jump to Page
Look Up in Index

Chapter 12 Notes > Section 10 > Page 1185 > Note (e) Previous note-----Next note
Notes for: The Principle of Computational Equivalence | Intelligence in the Universe

*Searching [for doubling rules]

No symmetric k=3, r=1 rule yields doubling. General rules can show subtle bugs; rule 1340716537107 for example first fails at n=24. The total number of k=3, r=1 rules that need to be searched can easily be reduced from 3^27 to 3^21. Several different rules that work can behave identically, since up to 6 of the 27 cases in each rule are not sampled with the initial conditions used. In rules that work, between 8 and 19 cases lead to a change in the color of a cell, with 14 cases being the most common.


Page image


Pages related to this note:


All notes on this page:

* Dead languages
* Teleology
* Possible purposes [for systems]
* Purposeful computation
* Doubling rules [cellular automata]
* Searching [for doubling rules]
* All notes for this section
* Downloadable programs for this page
* Downloadable images
* Search Forum for this page
* Post a comment
* NKS | Online FAQs
From Stephen Wolfram: A New Kind of Science [citation] Previous note-----Next note