When the conditions are controlled then so is the probability. The results of this research should not be surprising despite the tone of the article.
Actually, even if you can have data at atomic level you still have chaos theory and butterfly effect preventing you from making prediction. Then even some small fluctuation born by the Plank's "uncertainty principle" can grow up in time to big enough error.
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.)
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.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.