How to prove the uncountability of reals by using "describability"? It is well known that there are more irrational numbers than there are rational ones, and a typical prove for that is the Dedekind cut. Thinking about alternative proves I came up with the following idea:


*

*Interpret any $n\in\mathbb N$ as a hexadecimal number and convert it to a string (using e.g. UTF-8 encoding).

*Of all the strings obtained this way, only consider those that provide plain English instructions via which one or more real numbers can be obtained.

*All numbers obtained this way are called "describable", the set of them shall be denoted $\mathbb D$.


Now my problem: Since $\mathbb R$ is uncountable, this means there must be an uncountable amount of "indescribable" real numbers $\mathbb I := \mathbb R\backslash \mathbb D$. But using the "describability" defined above, $\mathbb N$ can provide infinitely many descriptions of arbitrary lengths (thus $\mathbb D$ is countable as well), and I fail to see how the countability of $\mathbb N$ can imply the uncountability of $\mathbb I$ (other than already asserting the uncountability of $\mathbb R$). So can the uncountability of $\mathbb I$ be proven?

Since no requirement is made about finite evaluation of the description of any $d\in\mathbb D$, I think $\mathbb D$ is a superset of the computable numbers, though I'm not sure.
 A: By contradiction, I (think I) can merely prove that there are either uncountably many indescribable numbers or none at all: Assume $\mathbb I\neq \{\}$ and $\mathbb I$ is countable. Then there exists a mapping of $\mathbb N$ to $\mathbb I$. That in turn implies all $i\in\mathbb I$ can actually be described⁺, contradicting $\mathbb I = \mathbb R\backslash \mathbb D$.
My problem is I don't have a clue how to prove that there are indescribable numbers at all, since intuitively one can always describe at least one indescribable number as "a random number picked from the set of indescribable numbers".

⁺ Since $\mathbb I$ is asserted countable, it can be ordered. Then obviously each element of $\mathbb I$ could be described by the string "The $n^\text{th}$ element of $\mathbb I$".
A: There's some "meta" character of this construct. Basically what you mean by describable is that the number has a formula for it in the formal language of mathematics (or in another language). The way the apparent paradox can be dismissed varies depending an the actual formal system that's in use. This can be done in various ways - disallowing your construct at some step.
From Cantor's proof we surely know that $\mathbb R$ is uncountable and one can certainly argue that $\mathbb D$ should be countable. The consequence of this is that $\mathbb I=\mathbb R\setminus\mathbb D$ should be uncountable.
Of course a proof not using Cantor's proof is quite hard to construct. Obviously a proof for the non-emptyness of $\mathbb I$ can't rely on a concrete description of any element of $\mathbb I$. It also can't rely on any other reference to a number in $\mathbb I$ since without them being describable and without $\mathbb I\ne\emptyset$ having already been established one cannot use such a construct. This means that one would probably need to use proof by contradiction at some point.
