I believe the concept of computable/uncomputable numbers is what you're looking for. In less technical language than the Wikipedia page, a number is computable if we can make a computer generate the first $n$ digits of the number (it doesn't matter how long it takes as long as it will eventually finish) for any integer $n$. Via root-finding algorithms, all algebraic numbers are computable, as are $\pi,e$, etc. via infinite series. So are some less obvious examples like $\Gamma(a/b)$ for any $a,b$ and some other things. But, similarly to what you were saying with "descriptions," the number of such algorithms is countable, so the cardinality of computable numbers is also countable.
So, not only are there uncomputable numbers, but "almost every" number is uncomputable.