Earlier quoted context omitted.
> Start with binary non-negative integers: > 000 001 010 011 100 101 ... (goes to infinity) > This set now includes all possible bit strings of > infinite length No, it only contains the strings of finite length. There are infinitely many of them, but each one stops after a while. In particular, then n^th one only has log2(n) places before it then becomes all 0s. > This is also an enumerable set by definition. Yes. >…
Edit: This comment should be read after my comment below this. It shows up first on HN. If infinity was in the original set, what would diagonalisation produce? [Genuinely asking, I am unclear on this.] I am flipping all the bits along a diagonal and they are all zeros before flipping. If 0.99999... = 1, then using my argument of flipping the bits around the decimal, wouldn't infinity be in the set?
> If infinity was in the original set,
What does this mean? Your complete imprecision is making it impossible to answer the questions, despite wanting to help, because they don't make sense.What set? Define it clearly. Don't talk about infinite strings of zeros followed by stuff, because in the context of decimal or binary expansions that doesn't make sense. Strings have a start, then they go on one place at a time.,
> I am flipping all the bits along a diagonal and they
> are all zeros before flipping.
If they are all zero before flipping then 0.11111... isn't there. You've stated that the n^th number has 0 in the n^th place. That means 0.11111... is not the n^th number for any n.If 0.99999... = 1, then using my argument of flipping the bits around the decimal, wouldn't infinity be in the set?