Download PDFOpen PDF in browser

A note on Türing 1936

EasyChair Preprint no. 8882

6 pagesDate: September 26, 2022


Tü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: definable numbers, Diagonalization porcedures, Türing Machine

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Paola Cattabriga},
  title = {A note on Türing 1936},
  howpublished = {EasyChair Preprint no. 8882},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser