as every instruction is determinedso it's difficult to invent some algorithm that generates non-pseudo random number under the current architecture.
I feel it's enough to use pseudo random number to simulate the randomness, with seed set randomly.
A more interesting question is this:
Does random really exist?
Think about tossing a coin, the result (head or tail) is determined by the initial speed, gravity, wind direction, table material etc. If the modeling of the enviornment is complete, the result will always be the same under the same parameters.
So the randomness comes from the inability of describing the world completely, is that true?
maybe
"So the randomness comes from the inability of describing the world completely, is that true?"
I think you are right. However, if the "inability of describing the world completely" is certain to us, random exist, to us.
Maybe, randomness is not universal, but relative to the object concerned.
In a computer, although every instruction is determined, environment out of the world is not. eg. consider we are writing an application that throw a dice when the user click a button. We may use clock() to generate a random number.
Here the randomness is determined by time. Assuming a user (or device) can not distinguish time from 1ms. And our computer's clock() has resolution of 1/6 ms. Shall we treat it as a true random (to the player).
I think you are right. However, if the "inability of describing the world completely" is certain to us, random exist, to us.
Maybe, randomness is not universal, but relative to the object concerned.
In a computer, although every instruction is determined, environment out of the world is not. eg. consider we are writing an application that throw a dice when the user click a button. We may use clock() to generate a random number.
Here the randomness is determined by time. Assuming a user (or device) can not distinguish time from 1ms. And our computer's clock() has resolution of 1/6 ms. Shall we treat it as a true random (to the player).