..the universal distribution is in some sense a good approximation of any computable distribution. (Apparently that’s what the “universal” in UD means, as opposed to meaning that it’s based on a universal Turing machine.)
This is a very interesting claim. The way you say it here suggests it’s a proven result but neither of the links explain (to me) why this is true, or exactly what it means. Could you elaborate?
Something of this nature might well be implied by the Algorithmic Complexity article but I don’t understand how, other than that the UD assigns P>0 to all computable hypotheses consistent with the data, which seems weaker than what I think you’re claiming.
This is a very interesting claim. The way you say it here suggests it’s a proven result but neither of the links explain (to me) why this is true, or exactly what it means. Could you elaborate?
Something of this nature might well be implied by the Algorithmic Complexity article but I don’t understand how, other than that the UD assigns P>0 to all computable hypotheses consistent with the data, which seems weaker than what I think you’re claiming.