3 ms·
Not correct. If it was random, the output does not depend on the input (or there is no meaningful input). But they showed that the output depends on the input
by ars 17y ago
Not correct.
If it was random, the output does not depend on the input (or there is no meaningful input).
But they showed that the output depends on the input. So it's NOT random.
Biased random means the result is not uniform, but it does not depends on the input.
No so here. Here it's not biased - it simply depends on the input.
(Obviously pseudo random number generators depend on the input - but those explicitly are not random, they are simply useful.)
- scott_s 17y agoIt's not a completely deterministic process, and I have no other way to characterize non-determinism. While the initial conditions bias the result, the result is not determined by the initial conditions. The result is still probabilistic. Let's assume we have a function true_random() that returns a true random value between 0 and 1. Now let's define f(x) as: def f(x): r = true_random() if r < 0.5: return r else: return x Half the time, it returns a random value between 0 and 1. The other half, it returns its input. This is still a random process.
- sgk284 17y agoThere is a nice way to define randomness by determining if given a string generated by the process (i.e. 010101011110101)can you write a program smaller than the string that will output that string for any string generated by the process. This is called Kolmogorov randomness and has nothing to do with how input effects the output. In this instance, any string generated by a million coin tosses couldn't be reproduced by an algorithm that is smaller than the string, in general. By this metric I'd argue that the process is still random. Just because the input has an effect on the output, doesn't make the output less random. "F(x) = x + rand()" is still a random function.