New answers tagged kolmogorov-complexity
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 ...
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 ...
Top 50 recent answers are included
Related Tags
kolmogorov-complexity × 114complexity-theory × 22
computability × 22
turing-machines × 15
information-theory × 13
data-compression × 8
randomness × 7
terminology × 6
time-complexity × 5
descriptive-complexity × 5
algorithms × 4
programming-languages × 4
formal-languages × 3
algorithm-analysis × 3
regular-languages × 3
reference-request × 3
pseudo-random-generators × 3
optimization × 2
machine-learning × 2
undecidability × 2
approximation × 2
lambda-calculus × 2
strings × 2
space-complexity × 2
computation-models × 2