About random numbers

All random number generators are based upon specific mathematical algorithms, which are repeatable and sequential. As such, the numbers are just pseudorandom. Here, for simplicity, we shall term them just ``random'' numbers, subject to this realization. Formally,

• Truly random - is defined as exhibiting ``true'' randomness, such as the time between ``tics'' from a Geiger counter exposed to a radioactive element.
• Pseudorandom - is defined as having the appearance of randomness, but nevertheless exhibiting a specific, repeatable pattern.
• Quasi-random - is defined as filling the solution space sequentially (in fact, these sequences are not at all random - they are just comprehensive at a preset level of granularity). For example, consider the integer space [0, 100]. One quasi-random sequence which fills that space is 0, 1, 2,...,99, 100. Another is 100, 99, 98,...,2, 1, 0. Yet a third is 23, 24, 25,..., 99, 100, 0, 1,..., 21, 22. Pseudorandom sequences which would fill the space are pseudorandom permutations of this set (they contain the same numbers, but in a different, ``random'' order).

In cecile, we use `pseudorandom' numbers based on linear congruential generators. Below you will find the test of that generators and some conclusions.