On Mar 8, 7:49 am, William Hughes <wpihug...@gmail.com> wrote: > On Mar 7, 10:07 pm, Graham Cooper <grahamcoop...@gmail.com> wrote: > > > every single string appears on the DIAGONAL and ANTI-DIAGONAL > > This is false, you know it is false and you have admitted > it is false.
true by induction on Diagonals of N-1 digits long on NxN lists.
AND your anti-diagonal (a misnomer at best, NEW-Diagonal)
is not computable by any Turing Machine
GIVEN ANY INFINITE LIST
Herc -- S: IF HALT(S) GOSUB S
Proves that Functions are UN-COMPUTABLE! ~ G. Greene (sci.logic)