3 ms·
>The mathematics of Kolmogorov complexity[1] formalizes the idea that a given finite fixed string is "random". I read into the wiki article and this approach i
by leni536 12y ago
>The mathematics of Kolmogorov complexity[1] formalizes the idea that a given finite fixed string is "random".
I read into the wiki article and this approach is certainly interesting. However this complexity depends on the description language so there is no unique way to determine if a string is random.
- bo1024 12y agoRight. However, the idea is for any two ways (say Java and Haskell), there will be a constant so that they will agree on all strings up to a constant. So it's quite robust and seems to capture something fundamental or deep about randomness and information...