Elementary cellular automaton/Random number generator: Difference between revisions
Content added Content deleted
m (→{{header|Pascal}}: inline all together to get next byte doubles speed. ~4/5 cycles per Bit.Needs long wake up to get stable results) |
|||
Line 155: | Line 155: | ||
<lang fsharp> |
<lang fsharp> |
||
// Generate random numbers using Rule 30. Nigel Galloway: August 1st., 2019 |
// Generate random numbers using Rule 30. Nigel Galloway: August 1st., 2019 |
||
eca 30 [|yield 1; yield! Array.zeroCreate 99|] |
eca 30 [|yield 1; yield! Array.zeroCreate 99|]|>Seq.chunkBySize 8|>Seq.map(fun n->n|>Array.mapi(fun n g->g.[0]<<<(7-n))|>Array.sum)|>Seq.take 10|>Seq.iter(printf "%d "); printfn "" |
||
</lang> |
</lang> |
||
{{out}} |
{{out}} |
||
Line 161: | Line 161: | ||
220 197 147 174 117 97 149 171 240 241 |
220 197 147 174 117 97 149 171 240 241 |
||
</pre> |
</pre> |
||
=={{header|Go}}== |
=={{header|Go}}== |
||
{{trans|C}} |
{{trans|C}} |