12 Nov
2004
12 Nov
'04
1:01 p.m.
On Fri, Nov 12, 2004 at 02:15:51PM +0100, Jerzy Karczmarczuk wrote:
First, we don't care about 'real random' numbers, actually there are problems even with their definition. We need sequences which *behave* randomly, from the point of view of feasible tests, spectral/statistical; correlational, etc.
While this is true (and important) for the applications you have in mind, there are other applications. For instance, in cryptography there is often a need for true random numbers, or as close as you can get. I'm not sure what the whole discussion is about, anyway. Is it about dealing with random numbers practically in Haskell? Peace, Dylan