In article <firstname.lastname@example.org>, email@example.com wrote:
> > > But do you agree that the Cantor pairing function does provide a bijection? > > Up to every desired n and q_n.
Unless WM can name a specific last n and last q_n, which he can't, why should anyone believe that the process ends before all infinitely many n's and all infinitely many q_n's have been simultaneously exhausted? -- Virgil "Mit der Dummheit kampfen Gotter selbst vergebens." (Schiller)