whyterabbyt wrote:Robert Randolph quoth
Anything derived from a clock can be predictable given the seed (the time in point where the clock is sampled) and the algorithm...
Ummm, are you sure? Just the fact that your machine can never boot at the same point in space/time twice in a row means that sampling the realtime clock for the first time on any given boot-up is non-predictable from boot to boot.
such routines are pseudorandom simply because they lack complete unpredictability....
For the reasons above, Im not sure about that. The random-number generation is pseudorandom in and of itself, but when provided with an unpredictably non-repeating seed, I would hazard that they do lack predictability. And if one resamples that seed (or another, say the current onscreen raster position of your display) at pseudorandom intervals I'd really like to know where the predictablity comes from...
though in use it's of course it's perceptibly and practically random. just semantics again really...
True.
It's not random because you can predict what the value will be if given the seed and algorithm. Since using a clock of anykind is a fairly stable and predictable seed, it's not really presumptious to assume you could predict the 'random number' if one really so desired. The problem is you will always know (or can know) all the variables as they are generated or assumed... which means theorectically you could take those numbers and predict the outcome before the generation completely occurs. You can go through many chains of "randomness" but as the author of it, you will always know the possibilities and the bounds. Which means there is a finite set of solutions from a single algorithm with known variables.
Practical? not at all... possible? certainly. And the possibility makes it not "true" randomness... as incredibly semantic and silly as it is.

