|
|
|
|
|
|
by lmm
1617 days ago
|
|
|
It's easy to calculate an upper bound on the Kolmogorov complexity of a given value (you just have to exhibit a Turing machine that computes it), but very hard to prove a lower bound (you would have to prove something about all possible Turing machines). |
|
|