The Invalidity of Diagonalization Proof for Halting Problem
by
n.n.
BibTeX
@MISC{n.n._theinvalidity,
author = {n.n.},
title = {The Invalidity of Diagonalization Proof for Halting Problem},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We examine the converse of Church-Turing thesis and establish the existence of uncountable number of accelerated Turing machines. This leads to the case that these machines are unaffected by Gödel's incompleteness theorem. We also
Citations
| 914 | On computable numbers, with an application to the ”Entscheidungsproblem - Turing - 1936 |
| 97 | Systems of Logic Based on Ordinals - Turing - 1939 |
| 24 | Hypercomputation: computing more than the turing machine - Ord - 2002 |
| 9 | The Broad Conception of Computation - Copeland - 1997 |
| 3 | Unconventional Models of Computation, chapter Even Turing Machines Can Compute Uncomputable Functions - Copeland - 1998 |
| 1 | A formalisation of non-finite computation. M.phil dissertation - Wischik - 1997 |
