44 ms·
> Or, you can also easily build a bijection between a finite number of symbols and N. That's just an encoding like ASCII or UTF-8. Therefore, the set of names i
by thaumasiotes 4y ago
> Or, you can also easily build a bijection between a finite number of symbols and N. That's just an encoding like ASCII or UTF-8. Therefore, the set of names is countably infinite.
You've confused two different senses of "a finite number of symbols". The requirement is that it takes a finite number of symbols to write down any given number, not that it takes a finite number of symbols to write down every number at once. (Though in fact that also takes a finite number of symbols; it is the precise meaning of ℝ.)
Symbols are, in their simplest interpretation, bounded two-dimensional curves; there is no danger of running out of them before we run out of numbers.