Like PaulFChistiano said, the shortest accurate program isn’t particularly useful, but its predictive model is more a priori probable according to the universal / Occamian prior.
It’s really hard (and uncomputable) to discover, understand, and verify the shortest program that computes a certain input->prediction mapping. But we use the “shortest equivalent program” concept to judge which human-understandable program is more a priori probable.
Like PaulFChistiano said, the shortest accurate program isn’t particularly useful, but its predictive model is more a priori probable according to the universal / Occamian prior.
It’s really hard (and uncomputable) to discover, understand, and verify the shortest program that computes a certain input->prediction mapping. But we use the “shortest equivalent program” concept to judge which human-understandable program is more a priori probable.