"Graham Cooper" wrote in message news:b1e809aa-8ce8-4c0a-a136-66c5524c0246@ri8g2000pbc.googlegroups.com...
On May 17, 7:07 am, Shmuel (Seymour J.) Metz <spamt...@library.lspace.org.invalid> wrote: > > In <jouvko$58...@speranza.aioe.org>, on 05/16/2012 > > at 02:24 AM, "LudovicoVan" <ju...@diegidio.name> said: > > > > >You can't. > > > > Nor can anybody else. > > > that's because you are asking the WRONG QUESTION! > > I can provide an INFINITE LIST of INFINITE LISTS of ALL REALS!
If by "list" you mean a bijection between naturals and reals then no.
> > All 100% computable and trivially so! > > EACH INFINITE LIST OF REALS is a DIFFERENT PERMUTATION of the SAME > COMPLETE SET OF REALS.
If by "list" you mean a bijection between 2^aleph_null ordinals and all the reals, all well ordered, then yes. But in this case there can be no anti-diagonal created from the list of all 2^aleph_null reals.
> > The ANTI-DIAGONAL of the 1ST LIST OF ALL REALS > is computable by some other LIST OF ALL REALS > in the infinite sequence of LISTS, all computable by 1 single Turing > Machine!
