
Re: R > oo
Posted:
Mar 8, 2013 8:55 PM


On Mar 9, 10:46 am, William Hughes <wpihug...@gmail.com> wrote: > There is a sequence the DIAGONAL cannot be. > The DIAGONAL can be any sequence. > > GC tries to justify this!?!
Your claims are not computable
as infinite sequences never end.
By Induction on N for NxN lists DIAG=/=ANTIROW
By Induction on N1 for NxN lists
DIAG = ANTIDIAG = 10^N1 = ALL STRINGS
Your property of Unique Missing String is nullified.
Note DIAG as N>oo is computable
INFSTRING1 = INFSTRING2 is not computable.

Your claim of GIVEN AN INFINITE LIST you can CALCULATE A MISSING REAL
cannot be done by any Turing Machine that Halts.
It is ENTIRELY TRIVIAL that anything that follows such a higher cardinality set theory are all based on NonComputable Axioms.
Herc  www.BLoCKPROLOG.com

