I've used it (by using Normalized Compression Distance) in my Master degree.
It was very interesting to find out how efficient it was in authorship attribution, even having 100 possible authors.
Kolmogorov Complexity – A Primer (2012)
21–22 of 22 posts
Re: Kolmogorov Complexity – A Primer (2012)
#22Earlier quoted context omitted.
How many times do you want people to tell you that everybody knows that Kolmogorov complexity (KC) is only defined up to a constant? This does not affect the results that people use KC for, like the incompressibility of most strings.
That's what my second post linked above addresses. I think it does affect the 'incompressibility of most strings' result. I'm fine with not rehashing the argument though, unless you're keen to do so :)
What you need to do is produce a programming language L such that the existence of incompressibility of strings becomes false, e.g. contradict Theorem 2.2.1 of Li & Vitanyi.