• 3/7/12 12:23 pm
- 882 views • 0 today
- Progress
- 100% complete
Added Creditredstonewarrior
- 3
- 1
- 3
15
A cellular automaton is a grid where every pixel's state relies it's previous state (and the previous state of the ones around it.) Wolfram's rule 110, a specific rule set for such a system, has been proven to be Turing complete (able to do universal computation.) I was running around in an old world today and discovered an old 4x4 modular cell I had made for this rule set, so I created a new (better) one and filled an entire plot with it. Here are the results.
Modular cell (4x9hx4)
32x32 grid (128x9hx128)
Wikipedia article on 110
Wikipedia article on cellular automaton
Remember, you can make that do calculus if you programmed it correctly.
Modular cell (4x9hx4)
32x32 grid (128x9hx128)
Wikipedia article on 110
Wikipedia article on cellular automaton
Remember, you can make that do calculus if you programmed it correctly.
More like this
648252
2

Have something to say?
Your cell's are very small : ) Nice work.