Does Cantor's diagonal "algorithm" generate an interesting subset of R?
Hi everyone, I have a question regarding the algorithm at the heart of Cantor's diagonal argument. That is we have a list of numbers (It can be finite or infinite) and a new number is added based on the digits of the previous numbers.
I don't care about proving anything about the cardinality of R, I'm interested in the sub-set of R that is actually generated starting from a particular list (be it finite or infinite).
Is there a list of numbers (cardinality N at most obviously) that "generate" all of R starting with this algorithm? More formally, for every r in (0,1) is it true that r is reached by my ever growing list after a certain amount of iterations? I'd intuitively say no, but at this point my intuition starts to break down a little, especially with AC.
The idea behind this was noticing a similarity with span in linear algebra, maybe the sub-set generated by a particular list has some interesting properties, and when I add a new number to the list I'm adding a new class of numbers after a certain amount of iterations.
I'm imagining this can be generalized with any recursive algorithm, so probably there is something similar already out there.
Does anybody know if this question is explored somewhere, and if not how would I approach this?