That seems like a general argument against the whole Solomonoff Induction approach. I’d be happy to see the dependence on an encoding of algorithms removed, but until someone finds a way to do so, it doesn’t seem to be a deal-breaker. I think my claim should apply to any encoding of algorithms one might use that isn’t contrived specifically to make it false.
The Solomonoff prior depends on the encoding of algorithms, the Born rule doesn’t. Or am I missing anything?
That seems like a general argument against the whole Solomonoff Induction approach. I’d be happy to see the dependence on an encoding of algorithms removed, but until someone finds a way to do so, it doesn’t seem to be a deal-breaker. I think my claim should apply to any encoding of algorithms one might use that isn’t contrived specifically to make it false.