Does undecidability ever imply unmeasurability and make a notion of probability ill-defined?
The space of possible inputs of a Turing machine is countable, so all its subsets are measurable. Same for outputs.
However, it's possible that this probability is not computable. In particular, you may want to look up Chaitin's constant. It isn't exactly what you are talking about, but closely related.