This is really interesting. We could take it further and say that, given that some uncomputable reals have a finite definition (e.g. "the probability that a random algorithm halts"), there is a countable number of definable reals (by assigning a Godel number to each definition), so the uncountability of the reals is strictly due to indefinable numbers!