Consider a system of linear equations over F2. Brute force search takes time exponential in the dimension. Gaussian elimination takes time polynomial in the dimension, and its description length is O(1). So your hypothesis clearly doesn’t work here. Now, it sounds more plausible if you assume your search problem is NP-hard. The question is whether this is a good model of intelligence. If this is a good model then it means that any intelligent agent will have enormous description complexity, and there is no better way of constructing one than doing brute force search. This probably implies a very long AGI timeline. However, I think it’s more likely that this is a bad model.
Consider a system of linear equations over F2. Brute force search takes time exponential in the dimension. Gaussian elimination takes time polynomial in the dimension, and its description length is O(1). So your hypothesis clearly doesn’t work here. Now, it sounds more plausible if you assume your search problem is NP-hard. The question is whether this is a good model of intelligence. If this is a good model then it means that any intelligent agent will have enormous description complexity, and there is no better way of constructing one than doing brute force search. This probably implies a very long AGI timeline. However, I think it’s more likely that this is a bad model.