Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2013
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/1308.0497 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- 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.