... this one comment: c i changed the values that knuth suggested to allow c running on a 16 bit integer ... in The Art of Computer Programming Volume by Donald E. Knuth, I guess this function uses the LinearCongruentialMethod described there: x(n+1) = (a * x(n) + c) mod m, n = .... Why not compare the constants in the code in Knuth's book with those in the 16-bit code? ...
On Dec 11, 10:24 pm, "allelopath" <jda...@gmail.com> wrote: You mean Knuth, vol 2, page 32?vol 2, *section* 3.2.1 Section 3.2.1 does describe the general principles of the linearcongruentialmethod but section 3.2.2 (page 32) refers to algorithm M, and algorithm B, "randomizing by shuffling". I have seen this code posted in one ...
...has this one comment: c i changed the values that knuth suggested to allow c running on a 16 bit integer ... in The Art of Computer Programming Volume by Donald E. Knuth, I guess this function uses the LinearCongruentialMethod described there: x(n+1) = (a * x(... least. I need values for 32 bit. You mean Knuth, vol 2, page 32? Can anyone offer advice? Yes, ...
...random number generator. It has this one comment: c i changed the values that knuth suggested to allow c running on a 16 bit integer machine Looking in The Art of Computer Programming Volume by Donald E. Knuth, I guess this function uses the LinearCongruentialMethod described there: x(n+1) = (a * x(n) + c) mod m, n = 0 where: m = modulus, ...
.... If the PRNG is a LINEAR congruence the answer is clearly no....The question of how good a linear recurence can be for two ...not be meet with typical simple linear congruence based PRNGs. There are a... very posive. I coded Knuth's method in assembler to call ... then Fortran at the time. Knuth is an excellent introduction that ... dated for some classes of results. Knuth offer several families of ...
...can legally get hold of small quantities of radioactive isotopes; another source of random interval events that follow a Gausian bell curve histogram.. I coded Knuth's method in assembler to call it as a library function, because there was a lot of bit section extraction from the middle of long ...
allelopath wrote: I plotted 5000 values on a graph. I'm not saying that this is scientifically rigorous. On Dec 15, 12:41 pm, Craig Powers <eni...@hal-pc.org> wrote: allelopath wrote: I should also statement that it does produce seemingly random numbers. Also, i see that I forgot to remove the declaration of the integer amHow have you evaluated "seemingly"? e.g. the ...
>> the 16-bit code? if you dig through this thread, e p chandler showed that the code was in reality written for 32-bit, despite the 16-bit comment. In my code critique request, I guess I was looking for comments regarding fortran conventions or perhaps reasonable optimizations.
I plotted 5000 values on a graph. I'm not saying that this is scientifically rigorous. On Dec 15, 12:41 pm, Craig Powers <eni...@hal-pc.org> wrote: allelopath wrote: I should also statement that it does produce seemingly random numbers. Also, i see that I forgot to remove the declaration of the integer amHow have you evaluated "seemingly"? e.g. the naked eye is a poor way to ...
