Skip to main content

New answers tagged

0 votes

Upper bound on Kolmogorov Complexity using compression algorithms

Kolmogorov complexity is only defined up to some additive constant (because there is no canonical choice of program interpreter), so talking about the Kolmogorov complexity of a single string in ...
Arno's user avatar
  • 3,293
2 votes
Accepted

Upper bound on Kolmogorov Complexity using compression algorithms

The short answer is you can't decompress a file without the information of the decompresser. Upper Bound Using Compression To estimate an upper bound on Kolmogorov Complexity using compression, you ...
Phillip Williams's user avatar

Top 50 recent answers are included