The way I understand Solomonoff induction, it doesn’t seem like the complexity of specifying the observer scales logarithmically with the total number of observers. it’s not like there’s a big phone book of observers in which locations are recorded. Rather, it should be the complexity of saying “and my camera is here”.
What’s the minimum number of bits required to specify “and my camera is here,” in such a way that it allows your bridging-law camera to be up to N different places?
In practice I agree that programs won’t be able to reach that minimum. But maybe they’ll be able to reach it relative to other programs that are also trying to set up the same sorts of bridging laws.
I’m no expert on this sort of thing, but if I understood correctly this seems exactly right. The complexity of the expression of each observer case shouldn’t differ based on the assigned position of the observer in an imaginary order. They’re all observer 1a, 1b, 1c, surely?
If observers are distributed with constant density in 3d space, then adding 3 extra bits to the position of a camera covers 8x the volume, and thus 8x the observers, so the scaling is the same as if you were just numbering the people
The way I understand Solomonoff induction, it doesn’t seem like the complexity of specifying the observer scales logarithmically with the total number of observers. it’s not like there’s a big phone book of observers in which locations are recorded. Rather, it should be the complexity of saying “and my camera is here”.
What’s the minimum number of bits required to specify “and my camera is here,” in such a way that it allows your bridging-law camera to be up to N different places?
In practice I agree that programs won’t be able to reach that minimum. But maybe they’ll be able to reach it relative to other programs that are also trying to set up the same sorts of bridging laws.
I’m no expert on this sort of thing, but if I understood correctly this seems exactly right. The complexity of the expression of each observer case shouldn’t differ based on the assigned position of the observer in an imaginary order. They’re all observer 1a, 1b, 1c, surely?
If observers are distributed with constant density in 3d space, then adding 3 extra bits to the position of a camera covers 8x the volume, and thus 8x the observers, so the scaling is the same as if you were just numbering the people