If it isn’t constant-length, then it seems strange to assume Solomonoff induction would posit a large objective universe, given that such positing wouldn’t help it predict its inputs efficiently (since such prediction requires locating agents).
but a solomonoff ind doesn’t rank hypotheses on whether they allow efficient predictions of some feature of interest, it ranks them based on posterior probabilities (prior probability + to what extent the hypothesis accurately predicted observations so far).
but a solomonoff ind doesn’t rank hypotheses on whether they allow efficient predictions of some feature of interest, it ranks them based on posterior probabilities (prior probability + to what extent the hypothesis accurately predicted observations so far).
I mean efficiently in terms of number of bits, not computation time. Which contributes to posterior probability.