aggle-rithm
Ardent Formulist
Take any non-trivial function f, and calculate f(something random). Won't the output f be random?
Correct me if I'm wrong, but isn't the very definition of a function the set of outputs given a certain set of inputs, such that there is one and only one output for any given input?
If so, the output cannot be random. It is determined by the input. The input may be random, but from the function's point of view, it is just an input, regardless of how it was generated. Thus, we end up with exactly the world we have, despite the fact that the chances against ending up with what we have are astronomical.
(The inputs, in this case, consist of such a huge number of initial conditions that I'm not sure there is any point in discussing it.)