Did Turing prove the undecidability of the halting problem?
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918219031248896 |
|---|---|
| author | Hamkins, Joel David Nenu, Theodor |
| author_facet | Hamkins, Joel David Nenu, Theodor |
| contents | We discuss the accuracy of the attribution commonly given to Turing's 1936 paper "On computable numbers..." for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_00680 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Did Turing prove the undecidability of the halting problem? Hamkins, Joel David Nenu, Theodor Logic Logic in Computer Science We discuss the accuracy of the attribution commonly given to Turing's 1936 paper "On computable numbers..." for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion. |
| title | Did Turing prove the undecidability of the halting problem? |
| topic | Logic Logic in Computer Science |
| url | https://arxiv.org/abs/2407.00680 |