The shortest program that generates shrimp-experience probably isn’t “our laws of physics + initial conditions + a locator for this particular shrimp.
You sure about that? Locating a particular shrimp isn’t that many more bits than locating a particular human on Earth. Population difference only a few OOMs.
But the argument is not: ‘Shrimp are hard to locate’.
The claim is: Shrimp experience (1) consists of quite few bits and (2) is still compressible. Therefore we can expect them to be generated by a quite short program that is plausibly shorter than K(our physics + initial conditions + locator).
And if you think shrimp have too complex experiences, then feel free to insert e.g. ‘planaria’ or ‘bacteria’.
You sure about that? Locating a particular shrimp isn’t that many more bits than locating a particular human on Earth. Population difference only a few OOMs.
No, I am not sure!
But the argument is not: ‘Shrimp are hard to locate’. The claim is: Shrimp experience (1) consists of quite few bits and (2) is still compressible. Therefore we can expect them to be generated by a quite short program that is plausibly shorter than K(our physics + initial conditions + locator). And if you think shrimp have too complex experiences, then feel free to insert e.g. ‘planaria’ or ‘bacteria’.
Does that clarify?