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.

翻译：通过仔细研读图灵1936年的原始论文，可以发现它基于一个声称定义了不可计算数的论断，并论证不存在能够计算可计算序列枚举中对角线的机器。本文细致分析了1936年的原始论证，揭示其何以不能被视为一个证明，且确实不存在证据表明存在如此定义的不可计算数。