Saved in:
Bibliographic Details
Main Author: Cattabriga, Paola
Format: Preprint
Published: 2013
Subjects:
Online Access:https://arxiv.org/abs/1308.0497
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • By closely rereading the original Turing's 1936 article, we can gain insight about that 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 provides a careful analysis of Turing's original argument, demonstrating that it cannot be regarded as a conclusive proof. Furthermore, it shows that there is no evidence supporting the existence of a defined number that is not computable.