If there’s a constant-length function mapping the universe description to the number of agents in that universe, doesn’t that mean K(n) can’t be more than the Kolmogorov complexity of the universe by more than that constant length?
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).
This still leads to the behavior I’m talking about in the limit; the sum of 1/2^K(n) over all n can be at most 1 so the probabilities on any particular n have to go arbitrarily small in the limit.
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).
The main loophole I see is that number-of-embedded-agents may not be decidable. That would make a lot of sense, since embedded-agent-detectors are exactly the sort of thing which would help circumvent diagonalization barriers. That does run into the second part of your argument, but notice that there’s no reason we need to detect all the agents using a single program in order for the main problem setup to work. They can be addressed one-by-one, by ad-hoc programs, each encoding one of the hypotheses (world model, agent location).
(Personally, though, I don’t expect number-of-embedded-agents to be undecidable, at least for environments with some kind of private random bit sources.)
At this point it seems simplest to construct your reference class so as to only contain agents that can be found using the same procedure as yourself. Since you have to be decidable for the hypothesis to predict your observations, all others in your reference class are also decidable.
Problem is, there isn’t necessarily a modular procedure used to identify yourself. It may just be some sort of hard-coded index. A Solomonoff inductor will reason over all possible such indices by reasoning over all programs, and throw out any which turn out to not be consistent with the data. But that behavior is packaged with the inductor, which is not itself a program.
If there’s a constant-length function mapping the universe description to the number of agents in that universe, doesn’t that mean K(n) can’t be more than the Kolmogorov complexity of the universe by more than that constant length?
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).
This still leads to the behavior I’m talking about in the limit; the sum of 1/2^K(n) over all n can be at most 1 so the probabilities on any particular n have to go arbitrarily small in the limit.
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.
I’m about 80% on board with that argument.
The main loophole I see is that number-of-embedded-agents may not be decidable. That would make a lot of sense, since embedded-agent-detectors are exactly the sort of thing which would help circumvent diagonalization barriers. That does run into the second part of your argument, but notice that there’s no reason we need to detect all the agents using a single program in order for the main problem setup to work. They can be addressed one-by-one, by ad-hoc programs, each encoding one of the hypotheses (world model, agent location).
(Personally, though, I don’t expect number-of-embedded-agents to be undecidable, at least for environments with some kind of private random bit sources.)
At this point it seems simplest to construct your reference class so as to only contain agents that can be found using the same procedure as yourself. Since you have to be decidable for the hypothesis to predict your observations, all others in your reference class are also decidable.
Problem is, there isn’t necessarily a modular procedure used to identify yourself. It may just be some sort of hard-coded index. A Solomonoff inductor will reason over all possible such indices by reasoning over all programs, and throw out any which turn out to not be consistent with the data. But that behavior is packaged with the inductor, which is not itself a program.
Yes, I agree. “Reference class” is a property of some models, not all models.