My favourite is related to the Kolmogorov Complexity of a string:
The problem of deciding if a string $s$ is compressible ($K(s) <^? |s| $) is undecidable
|
1 | [made Community Wiki] | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
My favourite is related to the Kolmogorov Complexity of a string:
|
||||
