Eugine_Nier 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)
Only if you insist on assigning non-zero probability to each individual program.
Is that responding to the "You can't possibly assign equal probability to every program in an infinite space" part of the parent comment? If you assign equal probability to every program in an infinite space, then (assuming "probability" refers to a real number, and not some other mathematical object such as an infinitesimal) either that equal probability is non-zero, in which case the sum is infinite, or the equal probability is zero, in which case the sum is zero. Remember, if all the probabilities are equal, then either all of them are equal to zero, or none are, and it's generally agreed that an infinite number of zeros add up to zero.
Actually 0·∞ is considered an indeterminate form. For example the interval from 0 to 1 has length 1 even though it's composed of infinitely many points each of which has length 0.
See my reply to asr for links to more technical explanations.
If you assign an equal probability to every program, and that probability is zero, then the sum, the total probability, is zero and. If you assign an equal nonzero probability, the probability is infinite.
If you want to have a valid probability distribution, you can't assign equal probabilities.
Well, if you're willing to relax the third axiom of probability to finite additivity you can. Alternatively, use an uncountable state space, e.g., the space of all ultra-filters on Turing machines. Also, while we're on the subject, there are numerous types of quasi-probability distributions worth considering.
Ah, fair enough. I had been assuming only real probabilities.