TimFreeman comments on Open Problems Related to Solomonoff Induction - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (102)
The description of x has to include the description of P, and that has to be computable if a universal distribution is going to assign positive probability to x.
If P has a short computable description, then yes, you can conclude that P is not a universal distribution. Universal distributions are not computable.
If the shortest computable description of P is long, then you can't conclude from this argument that P is not a universal distribution, but I suspect that it still can't be a universal distribution, since P is computable.
If there is no computable description of P, then we don't know that there is a computable description of x, so you have no contradiction to start with.