Timeline for Pseudo-random number generation algorithms
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2019 at 11:28 | review | Suggested edits | |||
| Sep 8, 2019 at 12:47 | |||||
| May 27, 2018 at 22:58 | comment | added | Rodrigo Zepeda | @NateEldredge The justifications are found in "Xorshift RNGs" (by Marsaglia) and the references given there (all Marsaglia's). The paper also has extensions for $32\times n$ bit generation. | |
| Dec 28, 2015 at 19:11 | comment | added | Nate Eldredge |
Also, it should be noted that the context of the post suggests that this code is intended for a system where unsigned long is 32 bits. These days most people are using x86-64 and compilers where unsigned long is 64 bits, so I don't think this code will work as designed. The high 32 bits probably won't "randomize" as one would wish. You'd want to change all the variables to uint32_t.
|
|
| Dec 28, 2015 at 19:08 | comment | added | Nate Eldredge | Where could one find justifications / analysis of this algorithm, of a more rigorous kind than "Marsaglia says it's good, and he's a smart guy"? | |
| Jun 30, 2010 at 14:31 | vote | accept | unknown | ||
| Jun 26, 2010 at 6:40 | history | answered | Alon Amit | CC BY-SA 2.5 |