  To a close reading of the original Turing article of 1936, we can learn it is
based on the claim to have defined a number which is not computable, arguing
that there can be no machine computing the diagonal on the enumeration of the
computable sequences. This article carefully analyses the original 1936
argument, displaying how it cannot be considered a demonstration, and that
there is indeed no evidence of such a defined number that is not computable.
