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.
Where does the number come from? If it's arbitrary, then it needs to be hardcoded in both the spec and the solution (thus similar KC). If it's algorithmically generated, the algorithm must be included in both, too. If it's a known constant, it can be abstracted away (low KC)