You are not currently logged in.
Access JSTOR through your library or other institution:
On the Possibility, or Otherwise, of Hypercomputation
P. D. Welch
The British Journal for the Philosophy of Science
Vol. 55, No. 4 (Dec., 2004), pp. 739-746
Published by: Oxford University Press on behalf of The British Society for the Philosophy of Science
Stable URL: http://www.jstor.org/stable/3541626
Page Count: 8
You can always find the topics here!Topics: Turing machines, Mathematical functions, Computability, Logical theorems, Philosophy of science, Nonstandard models, Oracles, Simulations, Logical impossibility, Eigenfunctions
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
We claim that a recent article of P. Cotogno () in this journal is based on an incorrect argument concerning the non-computability of diagonal functions. The point is that whilst diagonal functions are not computable by any function of the class over which they diagonalise, there is no 'logical incomputability' in their being computed over a wider class. Hence this 'logical incomputability' regrettably cannot be used in his argument that no hypercomputation can compute the Halting problem. This seems to lead him into a further error in his analysis of the supposed conventional status of the infinite time Turing machines of Hamkins and Lewis (). Theorem 1 refutes this directly.
The British Journal for the Philosophy of Science © 2004 The British Society for the Philosophy of Science