Is this a good way to understand the uncountability of uncomputable numbers (and the countability of the computables)? My feeling is the computable numbers are countable because they are associated with a finite string of symbols that give an algorithm for computing the number to arbitrary precision. The set of all finite strings in a given language is obviously countable as it is the countable union of finite sets.
Because $\mathbb R\setminus\textrm{Computable}=\textrm{Uncomputable}$, the uncomputables are uncountable.

Yes. That is the reason. Here is a more explicit explanation.
We are using two theorems here:


*

*If $A$ is countable, then the set of finite strings with characters in $A$ is countable.

*If $A$ is countable and $f\colon A\to B$ is a surjective function, then $B$ is [finite or] countable.
The first theorem tells us that indeed there are only countably many Turing machines—or whatever equivalent model of computation that you prefer to think about—and the second theorem tells us that since the map from a Turing machine to the real number it computes (assuming it computes one) is an obvious surjective function from the Turing machines onto the computable reals, there can be only countably many reals.
Of course, it still remains to verify that there are infinitely many computable reals, but that one is an easy exercise I will leave you.
And finally, since $\Bbb R$ is uncountable, if we remove a countable set of reals we keep an uncountable set of them. And in fact, the remainder has always cardinality $2^{\aleph_0}$. So indeed the set of uncomputable reals is uncountable.
