Anonymous user
Elementary cellular automaton/Infinite length: Difference between revisions
Elementary cellular automaton/Infinite length (view source)
Revision as of 17:54, 21 March 2014
, 10 years agomust include the infinite part
(Created page with "{{draft task}} The purpose of this task is to create a version of an Elementary cellular automaton whose number of cells is only limited by the memory size of the compute...") |
(must include the infinite part) |
||
Line 14:
More complex methods can be imagined, provided it is possible to somehow encode the infinite sections. But for this task we will stick to this simple version.
: But you can't stick to a simple version, and infinite padding beyond the edges must be included somehow. Suppose the visible part of the cells ends with "...110" and is followed by repeating 0s to infinity, and rule is just 1 (000->1). Now after one iteration those three cells become "000", but followed by repeating 1s instead. You can add another constraint that padding/edge cells don't change, but that would make the "infinite" part kind of pointless because changes won't propagate beyond edge cells. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 17:54, 21 March 2014 (UTC)
| |||