I just finished watching this video and I feel like I'm missing something very obvious. I've read quite a number of the questions here but haven't been able to figure out what.
I assume Hilberts hotel is relatively well known. So I won't go into the details. My question is regarding two cases:
case $1$: a bus with infinitely many people shows up. Everyone is accommodated by moving to the room with double their current room number, leaving infinite empty rooms.
case $2:$ a buss with infinitely many people shows up, this time everyone is labelled with an infinitely long string consisting out of $A$ and $B:$
$- AAAA...$
$- BAAA...$
$- ABAA...$
- etc.
The video explains that these people cannot be accommodated because Cantor's diagonal proof
In my mind, I would flip everyone's names, and switch out A for 0 and B for 1, then translate this from binary to a regular number:
$- AAAA... → ...000 → 0$
$- BAAA... → ...001 → 1$
$- ABAA... → ...010 → 2$
- etc.
And now you could apply the original method again of moving everyone up to a room of double their current room number. I fail to see why this wouldn't work.
The argument in the video is that there cannot be an exhaustive list of the passengers of the second bus because of earlier mentioned Cantor's diagonal. However, it seems to me you could just as well use Cantor's diagonal in the first bus, as long as you allow for leading zeros.
Could someone explain what the difference is between the first and second bus that I'm missing?