Download PDFOpen PDF in browserA note on Türing 1936EasyChair Preprint 88826 pages•Date: September 26, 2022AbstractTüring article of 1936 claims 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 closely examines 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. Keyphrases: Diagonalization porcedures, Türing Machine, definable numbers
|