We present classical theories for randomness, starting from mathematical ones to others focusing on randomness testing, more useful in computer science. Those characterisations are made by bounding the computational resources required for testing. Next, we present some suitable practical randomness testing suites designed to measure the quality of random strings that can be efficiently generated. Finally, random string generation by binary uniform cellular automata of increasing quality illustrates the improvements of the randomness testing suites.