Talk:Elementary cellular automaton/Random number generator: Difference between revisions

m
 
(5 intermediate revisions by 4 users not shown)
Line 15:
 
:::If you can confirm that with fixed boundary states, all ECA converge towards a finite state of "all 1" for any array size, then indeed it might be better to enforce warping arrays.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 20:04, 21 March 2014 (UTC)
 
:::: It took me more than a few moments to discover that &nbsp; '''eca''' &nbsp; stood for &nbsp; <big>''<u>e</u>lementary <u>c</u>elluar <u>a</u>utomation''</big>. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:10, 28 July 2019 (UTC)
 
::I can confirm that for 100 and 10 it does go to 1's for column that starts with a 1 in it doing Rule 30. Seems to me that you can't do [[Elementary cellular automaton]] and this task without making the former more specidic? What did you do with boundaries for your solution that works? --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 23:26, 21 March 2014 (UTC)
 
:::I did wrap them, as I found it much easier to implement. I will narrow the requirement in the parent task.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 02:24, 22 March 2014 (UTC)
 
::::Thanks Grondilu :-) <br> --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:34, 22 March 2014 (UTC)
 
==C Entry==
Perhaps the C entry is performing some undefined behavour (out-of-bound shifts at run-time, found statically with the D compiler):
<lang C>for (state = i = 0; i < N; i++)
if (rule & B(7 & (st>>(i-1) | st<<(N+1-i))))
</lang>
10,327

edits