Information AboutChaitin-kolmogorov Randomness |
|
Chaitin-Kolmogorov randomness distinguishes, at least in principle, between numbers that are generated by Pseudo-random Number Generator s and true Random Number s. However pseudo-random number generators and true random numbers are only distinguished in the limit. Any finite sequence of numbers no matter how apparently random can be generated by a large enough computer program while conversely a truly random sequence of numbers can have an arbitrarily long apparently non-random initial segment. In fact Chaitin 's incompleteness theorem shows that though we know that most strings are random in the above sense, the fact that a specific string is random can never be proven, if the string's length is above a certain threshold. Contrast with Statistical Randomness . SEE ALSO |
|
|