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.
-
-
This Tweet is unavailable.
-
In the sense that you can solve it in 20 lines of Python
End of conversation
-
-
-
aha, i see what you're saying. the brute force solution is clearly very low KC.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.