Elementary cellular automaton/Random number generator: Difference between revisions

Content added Content deleted

Inline

Revision as of 20:59, 19 March 2014

Rule 30 is considered to be chaotic enough to generate good random numbers. As a matter of fact, rule 30 is used by the Mathematica software for its default random number generator.

Steven Wolfram's recommendation for random number generation from rule 30 consists in extracting successive bits in a fixed position in the array of cells, as the automaton changes state.

The purpose of this task is to demonstrate this. With the code written in the parent task, which you don't need to re-write here, show the ten first bytes that emerge from this recommendation. To be precise, you will start with a state of all cells but one equal to zero, and you'll follow the evolution of the cells whose state was initially one. Then you'll regroup those bits by packets of eight, reconstituting bytes with a little-endian encoding.

You can pick which ever length you want for the initial array but it should be visible in the code so that your output can be reproduced with an other language.

For extra-credits, you will make this algorithm run as fast as possible in your language, for instance with an extensive use of bitwise logic.

Perl 6

A very easy to write, yet terribly slow version.

<lang Perl 6>my Automaton $a .= new: :rule(30), :cells( 1, 0 xx 40 );

say :2[$a++.cells[0] xx 8] xx 10; </lang>

Output:

220 197 147 174 117 39 39 136 93 11

@@ Line 4: / Line 4: @@
 Steven Wolfram's recommendation for random number generation from rule 30 consists in extracting successive bits in a fixed position in the array of cells, as the automaton changes state.
-The purpose of this task is to demonstrate this.  With the code written in the [[Elementary cellular automaton|parent task]], which you don't need to re-write here, show the ten first bytes that emerge from this recommendation.  To be precise, you will start with a state of all cells but one equal to 0, and you'll follow the evolution of the cells whose state was initially one.  Then you'll regroup those bits by packets of eight, reconstituting bytes with a little-endian encoding.
+The purpose of this task is to demonstrate this.  With the code written in the [[Elementary cellular automaton|parent task]], which you don't need to re-write here, show the ten first bytes that emerge from this recommendation.  To be precise, you will start with a state of all cells but one equal to zero, and you'll follow the evolution of the cells whose state was initially one.  Then you'll regroup those bits by packets of eight, reconstituting bytes with a little-endian encoding.
 You can pick which ever length you want for the initial array but it should be visible in the code so that your output can be reproduced with an other language.