cousin_it comments on Understanding and justifying 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 (75)
Yeah, that's correct. Note that it's also correct if you remove "longer than T": "For every program T, all but a finite number of other programs have lower probabilities". Which is obviously true because you can't have an infinite number of programs whose probability is above some threshold.
Sure, now that you've pointed it out I see that my conjecture was trivially true :)
I guess on the same line of thought you can informally deconstruct Occam's razor:
Might be worth a post to informally deduce Occam's razor.
It's a well known argument, I learned it from Shalizi's note. There's other work trying to justify Occam's razor when the set of hypotheses is finite, e.g. Kevin Kelly's work.
Thanks for the very interesting papers.
In Kelly's page, this
I think it is possible to appeal to simpler principles, modifying some of the points I made above.
Indeed, I think it is possible to non-circularly explain why