Anonymous user
Talk:Elementary cellular automaton/Infinite length: Difference between revisions
Talk:Elementary cellular automaton/Infinite length (view source)
Revision as of 08:21, 23 March 2014
, 10 years ago→Edge bits: On the edge of infinity...
(→Edge bits: On the edge of infinity...) |
|||
Line 10:
:: Regardless of the wording of the description, the intention is clear: try to represent an infinitely long row of cells, if only a finite portion is not of constant value. Given the simple case of rule 1 (000->1, everything else->0), and a starting state of every cell being 1 (what else can your "eca_infinite(1)" mean?), the cells should flip between all 0s and all 1s at each step. The python code does not reproduce that. I expect you to argue that your code fits one interpretation of the (imprecise) task description, and I expect myself to throw my hands up and say "suit yourself", but please do think about it before that. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 07:01, 23 March 2014 (UTC)
::: ''Regardless of the wording of the description'' ??
:::I admit that the use of the word infinity might be loose, but the author does go on to state what is meant. You can't really disregard their definition. I happen to like their intent which I see as ''incrementally'' extending the cells in a defined way. I can also see your point about Rule1. The task does seem to be implementable. Maybe we might all think of clarifications to the description? --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 08:21, 23 March 2014 (UTC)
| |||