I wonder if one can find empirical evidence of a link between the Kolmogorov complexity of a task and that of its solutions. Intuitively, I would think that problems that are simple to fully specify can be solved with comparably simple algorithms.
-
-
a counterexample wrt both runtime and kolmogorov complexity: 4-coloring
-
Both problem and solution have very small KC in this case (although solutions would have high runtime complexity)
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.