Summary
Under the banner of “hypercomputation” various claims are being made for the feasibility of modes of computation that go beyond what is permitted by Turing computability. In this article it will be shown that such claims fly in the face of the inability of all currently accepted physical theories to deal with infinite-precision real numbers. When the claims are viewed critically, it is seen that they amount to little more than the obvious comment that if non-computable inputs are permitted, then non-computable outputs are attainable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, Theodore P., John Gill, and Robert Solovay (1975). Relativizatons of the P =? NP Question. SIAM J. Comput. 4, 431–442.
Church, Alonzo (1937). Review of [20]. J. Symbolic Logic. 2, 42–43.
Copeland, B. Jack (1998). Turing’s O-Machines, Penrose, Searle, and the Brain. Analysis. 58, 128–38.
Copeland, B. Jack (2000). Narrow versus Wide Mechanism: Including a Reexamination of Turing’s Views on the Mind-Machine Issue. J. of Phil. 96, 5–32.
Copeland, B. Jack and Diane Proudfoot (1999). Alan Turing’s Forgotten Ideas in Computer Science. Scientific American, New York. 253:4, 98–103.
Davis, Martin (1958). Computability and Unsolvability. McGraw-Hill; reprinted with an additional appendix, Dover 1983.
Davis, Martin (1982). Why Gödel Didn’t Have Church’s Thesis. Information and Control. 54, 3–24.
Davis, Martin, ed. (1965). The Undecidable. Raven Press, New York.
Davis, Martin, (1987). Mathematical Logic and the Origin of Modern Computers. Studies in the History of Mathematics, pp. 137–165. Mathematical Association of America. Reprinted in The Universal Turing Machine — A Half-Century Survey, Rolf Herken, editor, pp. 149–174. Verlag Kemmerer & Unverzagt, Hamburg, Berlin 1988; Oxford University Press, Oxford, 1988.
Davis, Martin (2000). The Universal Computer: The Road from Leibniz to Turing. W. W. Norton, New York.
Davis, Martin (2001). Engines of Logic: Mathematicians and the Origin of the Computer. W. W. Norton, New York (paperback edition of [10]).
De Leeuw, K., E. F. Moore, C. E. Shannon, and N. Shapiro (1956). Computability by Probabilistic Machines. Automata Studies, Shannon, C. and J. McCarthy, eds., Princeton University Press, Princeton, 183–212.
Deutsch, David (1997). The Fabric of Reality. Allen Lane, The Penguin Press, New York.
Gandy, Robin (1980). Church’s Thesis and Principles for Mechanisms. In: The Kleene Symposium. Jon Barwise, ed. North-Holland, Amsterdam.
Hong, J. W. (1988). On Connectionist Models. Comm. Pure and Applied Math. 41, 1039–1050.
Park, Robert (2001). Voodoo Science. Oxford University Press, Oxford.
Siegelmann, Hava T. (1995). Computation Beyond the Turing Limit. Science 268, 545–548.
Siegelmann, Hava T. (1999). Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhäuser, Boston.
Smith, David Eugene (1929). A Source Book in Mathematics. McGraw-Hill, New York.
Turing, A. M. (1937). On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc. 42, 230–265. Correction: Ibid. 43, 544–546. Reprinted in [8, pp. 155–222], [24, pp. 18–56].
Turing, A. M. (1939). Systems of Logic Based on Ordinals. Proc. London Math. Soc. 45, 161–228. Reprinted in [8, pp. 116–154] and [24, pp. 81–148].
Turing, A. M. (1947). Lecture to the London Mathematical Society on 20 February 1947. In: A. M. Turing’s ACE Report of 1946 and Other Papers. B. E. Carpenter and R.N. Doran, eds. MIT Press 106–124. Reprinted in [23, pp. 87–105].
Turing, A. M. (1992). Collected Works: Mechanical Intelligence. D.C. Ince, ed. North-Holland, Amsterdam.
Turing, A. M. (2001). Collected Works: Mathematical Logic. R. O. Gandy and C. E. M. Yates, eds. North-Holland, Amsterdam.
Webb, Judson C. (1980). Mechanism, Mentalism, and Metamathematics. D. Reidel, Dordrecht.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Davis, M. (2004). The Myth of Hypercomputation. In: Teuscher, C. (eds) Alan Turing: Life and Legacy of a Great Thinker. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05642-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-05642-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05744-1
Online ISBN: 978-3-662-05642-4
eBook Packages: Springer Book Archive