Cellular Automata, Order from Chaos, Rule 110

Cellular Automata, are a variety Mathematical processes that exhibit behavior that can simulate real life and mathematical theories. The one in this video is a 1D process Rule 110. Its shows at first glance random behavior, but on a closer look, you can see structures, that work their way down, and colide with each other. Wolfram showed that with certain starting conditons (and a large enough grid), this rule can be used emulate (copy) any computer. This demonstartion is done on "Mirek's Cellebration"

Category:

Science & Technology

Tags:

• wolfram
• rule
• 110
• cellular
• Automata
• mathematics
• complex
• dynamics
• theories
• computing

[RandyLahey911]

How does the pattern emulate or copy a computer?

[MathDemos]

@RandyLahey911 This rule an emulate a "Turing machine" which can in turn emulate any type of computer.

[RandyLahey911]

@MathDemos How? Looks like some triangles to me.

[MathDemos]

@RandyLahey911 Yes, but each type of Triangle can represent one bit, like a computer, I strongly recommend you read "A New Kind of Science" by Wolfram, its about 900 pages but it is written so you do not need a math background. I read most of it when I was in seventh grade.

[senojelyk]

Read the Wikipedia article on rule 110, it gives a very general outline of the universality proof. You can use rule 110 to produce a cyclic tag system.

[Tikvanaya]

can emulate any computer? So, what do you have to do to make it calculate... 2+2 ?

[sssslamin]

@MathDemos i agree its a great book. still a little hard to read for me