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.
-
-
If we don't care about the time to find a good solution, then maybe? For many problems there is a naive solution (brute force) that is trivial to describe and then there are better algorithms that are harder to describe. E.g. most combinatorial problems, matrix multiplication
-
1/ Fermat's last theorem is an counter example. Unless you are claiming that there is much simpler solution. Millennium problems are in
- 4 more 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.