FACTOID # 9: Luxembourgers are the world's richest people - and also the most generous.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Rule 110

The rule 110 cellular automaton is a one-dimensional two-state cellular automaton with the following rule table: A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology. ...

current pattern 111 110 101 100 011 010 001 000
new state for center cell 0 1 1 0 1 1 1 0

Rule 110, like the Game of Life, exhibits what Stephen Wolfram calls "Class 4 behavior," which is neither completely random nor completely repetitive. Localized structures appear and interact in various complicated-looking ways. In the course of the development of A New Kind of Science, Wolfram's research assistant Matthew Cook proved that these structures were rich enough to support universal computation. 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. This means they may not be amenable to closed-form mathematical solutions. Gosper Glider Gun creating gliders. The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. ... Stephen Wolfram (born August 29, 1959 in London) is a scientist known for his work in particle physics, cellular automata and computer algebra, and is the creator of the computer program Mathematica. ... A New Kind of Science is a controversial book by Stephen Wolfram, published in 2002. ... Matthew Cook was born in Morgantown, West Virginia, in 1970 and grew up in Evanston, Illinois. ... The Turing machine is an abstract machine introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm or mechanical procedure. As such it is still widely used in theoretical computer science, especially in complexity theory and the theory of computation. ...


Matthew Cook presented his proof before the publication of A New Kind of Science at a Santa Fe Institute conference, which Wolfram Research claimed was a violation of Cook's nondisclosure agreement. The proof was stripped from the proceedings by court order. Nevertheless the proof's existence became known. However, the interest it generated was primarily about the technical details of its construction, rather than the significance of its existence--and hence of a considerably different character from its treatment in the book NKS. The Santa Fe Institute [SFI] is A non-profit research institute in Santa Fe, New Mexico founded by Murray Gell-Mann in 1984 to study complex systems and disseminate the notion of a separate interdisciplinary study of complexity theory. ...


Since the publication of A New Kind of Science, Matthew Cook has prepared a paper giving the complete proof, now published in Complex Systems, Volume 15, Issue 1.


image:CA_rule110s.png Smaller version of CA_rule110. ...


An example run of a rule 110 cellular automaton


Explanation of Universality Proof


  Results from FactBites:
 
Rule 110 cellular automaton - Wikipedia, the free encyclopedia (1202 words)
Rule 110, like the Game of Life, exhibits what Stephen Wolfram calls "Class 4 behavior," which is neither completely random nor completely repetitive.
Rule 110 was shown to be universal (or Turing complete) by showing it was possible to use the rule to emulate another computational model, the cyclic tag system, which is also universal.
This was accomplished by first isolating a number of spaceships, self-perpetuating localized patterns, that could be constructed on an infinitely repeating pattern in a Rule 110 universe, and second, devising a way for combinations of these structures to interact in a fashion that could be exploited for computation.
Minnesota General Rules of Practice for the District Courts (6103 words)
Rule 113.01 applies to assignment of a single case within a judicial district or county that does not already use a so-called block assignment system whereby cases are routinely assigned to the same judge for all pretrial and trial proceedings.
Rule 113.02 recognizes that motions for consolidation of cases within a single judicial district may be heard by the chief judge of the district or his or her designee.
Rule 113.03 is new, and is intended merely to establish a formal procedure for requesting the chief justice to exercise the power to assign multiple cases in different districts to a single judge when the interests of justice dictate.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.