1.G. The Random IFS Algorithm

Randomness

What makes an infininte sequence of digits random?
First, consider some examples of sequences, with a goal of characterizing randomness.
Motivated by our thoughts about these examples, we define an infinite sequence of digits to be random if it cannot be specified completely in any way shorter than listing the whole sequence.
How can we generate a random sequence?.
This implies random sequences have this property: every infinite sequence of random numbers contains all finite sequences. Here is the argument.
This property of randomness guarantees that the random and deterministic algorithms produce the same picture.

Return to the Random IFS Algorithm.