News for hackers. Stuff that matters.
Re:The $5000 Compression Challenge by leni536 on Sunday March 08, 2015 @11:31AM (#9165865)
>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.

Re:The $5000 Compression Challenge by bo1024 on Sunday March 08, 2015 @01:50PM (#9166377)
Right. 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...