Talk:Elementary cellular automaton/Random number generator: Difference between revisions
Content added Content deleted
(→Probably needs more restrictions: Thanks!) |
(+ C note) |
||
Line 21: | Line 21: | ||
::::Thanks Grondilu :-) <br> --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:34, 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> |
Revision as of 15:18, 27 September 2014
Endianness or MSB/LSB difference?
The description urges "little endian" (byte order in longer integer types), but was really talking about arranging bits in a byte. Misnomer? --Ledrug (talk) 18:54, 20 March 2014 (UTC)
- It seems so. My bad. Is "with the least significant bit at the end" correct?--Grondilu (talk) 09:55, 21 March 2014 (UTC)
Probably needs more restrictions
Rule 30 with fixed '0' ends just goes to '1' in all cells after a while. --Paddy3118 (talk) 06:33, 21 March 2014 (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? --Paddy3118 (talk) 23:26, 21 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>