If you want to pick out locations within some particular computation, you can just use the universal prior again, applied to indices to parts of the computation.
What you propose, ≈”weigh indices by kolmogorov complexity” is indeed a way to go about picking indices, but “weigh indices by one over their square” feels a lot more natural to me; a lot simpler than invoking the universal prior twice.
I think using the universal prior again is more natural. It’s simpler to use the same complexity metric for everything; it’s more consistent with Solomonoff induction, in that the weight assigned by Solomonoff induction to a given (world, claw) pair would be approximately the sum of their Kolmogorov complexities; and the universal prior dominates the inverse square measure but the converse doesn’t hold.
If you want to pick out locations within some particular computation, you can just use the universal prior again, applied to indices to parts of the computation.
What you propose, ≈”weigh indices by kolmogorov complexity” is indeed a way to go about picking indices, but “weigh indices by one over their square” feels a lot more natural to me; a lot simpler than invoking the universal prior twice.
I think using the universal prior again is more natural. It’s simpler to use the same complexity metric for everything; it’s more consistent with Solomonoff induction, in that the weight assigned by Solomonoff induction to a given (world, claw) pair would be approximately the sum of their Kolmogorov complexities; and the universal prior dominates the inverse square measure but the converse doesn’t hold.