Minds and Machines

, Volume 21, Issue 2, pp 221–239 | Cite as

Do Accelerating Turing Machines Compute the Uncomputable?

Article

Abstract

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical.

Keywords

Accelerating Turing machine Supertask Halting problem ATM paradox Hypercomputation External and internal computation Epistemic embedding Ontology of computing Turing-machine purism Turing-machine realism Thompson lamp paradox 

References

  1. Andréka, H., Németi, I., & Németi, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8, 499–516.MathSciNetMATHCrossRefGoogle Scholar
  2. Barker-Plummer, D. (2004). Turing machines. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy. http://www.plato.stanford.edu/archives/spr2005/entries/turing-machine.
  3. Beggs, E. J., & Tucker, J. V. (2006). Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation, 178, 25–43.MathSciNetMATHCrossRefGoogle Scholar
  4. Benacerraf, P. (1962). Tasks, super-tasks, and the modern eleatics. Journal of Philosophy, 59, 765–784.CrossRefGoogle Scholar
  5. Blake, R. M. (1926). The paradox of temporal process. Journal of Philosophy, 23, 645–654.CrossRefGoogle Scholar
  6. Boolos, G. S., & Jeffrey, R. C. (1980). Computability and logic (2nd ed.). Cambridge: Cambridge University Press.Google Scholar
  7. Calude, C. S., & Staiger, L. (2010). A note on accelerated Turing machines. Mathematical Structures in Computer Science, 20, 1011–1017.MATHCrossRefGoogle Scholar
  8. Cohen, R. S., & Gold, A. Y. (1978). ω-computations on Turing machines. Theoretical Computer Science, 6, 1–23.MathSciNetMATHCrossRefGoogle Scholar
  9. Copeland, B. J. (1997). The broad conception of computation. American Behavioral Scientist, 40, 690–716.CrossRefGoogle Scholar
  10. Copeland, B. J. (1998a). Even Turing machines can compute uncomputable functions. In C. S. Calude, J. Casti, & M. J. Dinneen (Eds.), Unconventional models of computation (pp. 150–164). Singapore: Springer.Google Scholar
  11. Copeland, B. J. (1998b). Super Turing-machines. Complexity, 4, 30–32.MathSciNetCrossRefGoogle Scholar
  12. Copeland, B. J. (1998c). Turing’s O-machines, Penrose, Searle, and the brain. Analysis, 58, 128–138.MathSciNetMATHCrossRefGoogle Scholar
  13. Copeland, B. J. (2000). Narrow versus wide mechanism: Including a re-examination of Turing’s views on the mind-machine issue. Journal of Philosophy, 97, 5–32.MathSciNetCrossRefGoogle Scholar
  14. Copeland, B. J. (2002a). Accelerating Turing machines. Minds and Machines, 12, 281–300.MATHCrossRefGoogle Scholar
  15. Copeland, B. J. (2002b). Hypercomputation. In B. J. Copeland (Ed.) (2002–2003), 461–502.Google Scholar
  16. Copeland, B. J. (Ed.) (2002–2003). Hypercomputation. Special issue of Minds and Machines, 12(4), 13(1).Google Scholar
  17. Copeland, B. J. (Ed.). (2004a). The essential Turing. Oxford and New York: Oxford University Press.MATHGoogle Scholar
  18. Copeland, B. J. (2004b). Colossus—its origins and originators. IEEE Annals of the History of Computing, 26, 38–45.MathSciNetCrossRefGoogle Scholar
  19. Copeland, B. J. (2004c). Hypercomputation: Philosophical issues. Theoretical Computer Science, 317, 251–267.MathSciNetMATHCrossRefGoogle Scholar
  20. Copeland, B. J. (2005). Comments from the chair: Hypercomputation and the Church-Turing thesis. Paper delivered at the American Philosophical Society Eastern Division Meeting, New York City.Google Scholar
  21. Copeland, B. J. (2010). Colossus: Breaking the German “Tunny” code at Bletchley Park. An illustrated history. The Rutherford Journal: The New Zealand Journal for the History and Philosophy of Science and Technology, 3, http://www.rutherfordjournal.org.
  22. Copeland, B. J., & Proudfoot, D. (1999). Alan Turing’s forgotten ideas in computer science. Scientific American, 280, 76–81.CrossRefGoogle Scholar
  23. Copeland, B. J., & Shagrir, O. (2007). Physical computation: How general are Gandy’s principles for mechanisms. Minds and Machines, 17, 217–231.CrossRefGoogle Scholar
  24. Copeland, B. J., & Sylvan, R. (1999). Beyond the universal Turing machine. Australasian Journal of Philosophy, 77, 46–66.CrossRefGoogle Scholar
  25. Davies, B. E. (2001). Building infinite machines. British Journal for the Philosophy of Science, 52, 671–682.MathSciNetMATHCrossRefGoogle Scholar
  26. Davis, M. (1958). Computability and unsolvability. New York: McGraw-Hill.MATHGoogle Scholar
  27. Earman, J., & Norton, J. D. (1993). Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes. Philosophy of Science, 60, 22–42.MathSciNetCrossRefGoogle Scholar
  28. Earman, J., & Norton, J. D. (1996). Infinite pains: The trouble with supertasks. In A. Morton & S. P. Stich (Eds.), Benacerraf and his critics (pp. 231–261). Oxford: Blackwell.Google Scholar
  29. Fearnley, L. G. (2009). On accelerated Turing machines. Honours thesis in Computer Science, University of Auckland.Google Scholar
  30. Fraser, R., & Akl, S. G. (2008). Accelerating machines: A review. International Journal of Parallel Emergent and Distributed Systems, 23, 81–104.MathSciNetMATHCrossRefGoogle Scholar
  31. Hamkins, J. D. (2002). Infinite time Turing machines. In B. J. Copeland (Ed.) (2002–2003), 521–539.Google Scholar
  32. Hamkins, J. D., & Lewis, A. (2000). Infinite time Turing machines. Journal of Symbolic Logic, 65, 567–604.MathSciNetMATHCrossRefGoogle Scholar
  33. Hogarth, M. L. (1992). Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters, 5, 173–181.MathSciNetCrossRefGoogle Scholar
  34. Hogarth, M. L. (1994). Non-Turing computers and non-Turing computability. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 1, 126–138.Google Scholar
  35. Hogarth, M. L. (2004). Deciding arithmetic using SAD computers. British Journal for the Philosophy of Science, 55, 681–691.MathSciNetMATHCrossRefGoogle Scholar
  36. Kripke, S. A. (1959). A completeness theorem in modal logic. Journal of Symbolic Logic, 24, 1–14.MathSciNetMATHCrossRefGoogle Scholar
  37. Lewis, H. R., & Papadimitriou, C. H. (1981). Elements of the theory of computation. Englewood Cliffs, NJ: Prentice-Hall.MATHGoogle Scholar
  38. Newman, M. H. A. (1955). Alan Mathison Turing, 1912–1954. Biographical Memoirs of Fellows of the Royal Society, 1, 253–263.CrossRefGoogle Scholar
  39. Pitowsky, I. (1990). The physical Church thesis and physical computational complexity. Iyyun, 39, 81–99.Google Scholar
  40. Post, E. L. (1936). Finite combinatory processes–formulation 1. Journal of Symbolic Logic, 1, 103–105.MATHCrossRefGoogle Scholar
  41. Potgieter, P. H., & Rosinger, E. E. (2010). Output concepts for accelerated Turing machines. Natural Computing, 9, 853–864.Google Scholar
  42. Quine, W. V. O. (1960). Word and object. Cambridge, MA: MIT Press.MATHGoogle Scholar
  43. Russell, B. A. W. (1915). Our knowledge of the external world as a field for scientific method in philosophy. Chicago: Open Court.Google Scholar
  44. Schaller, M., & Svozil, K. (2009). Zeno squeezing of cellular automata. arXiv:0908.0835.Google Scholar
  45. Shagrir, O. (2004). Super-tasks, accelerating Turing machines and uncomputability. Theoretical Computer Science, 317, 105–114.MathSciNetMATHCrossRefGoogle Scholar
  46. Shagrir, O. (2011). Supertasks do not increase computational power. Natural Computing (forthcoming).Google Scholar
  47. Shagrir, O., & Pitowsky, I. (2003). Physical hypercomputation and the Church-Turing thesis. In B. J. Copeland (Ed.) (2002–2003), 87–101.Google Scholar
  48. Steinhart, E. (2002). Logically possible machines. Minds and Machines, 12, 259–280.MATHCrossRefGoogle Scholar
  49. Steinhart, E. (2003). The physics of information. In L. Floridi (Ed.), The Blackwell guide to the philosophy of computing and information (pp. 178–185). Oxford: Blackwell.Google Scholar
  50. Stewart, I. (1991). Deciding the undecidable. Nature, 352, 664–665.CrossRefGoogle Scholar
  51. Svozil, K. (1998). The Church-Turing thesis as a guiding principle for physics. In C. S. Calude, J. Casti, & M. J. Dinneen (Eds.), Unconventional models of computation (pp. 371–385). London: Springer.Google Scholar
  52. Thomson, J. F. (1954). Tasks and super-tasks. Analysis, 15, 1–13.CrossRefGoogle Scholar
  53. Thomson, J. F. (1970). Comments on professor Benacerraf’s paper. In W. C. Salmon (Ed.), Zeno’s paradoxes (pp. 130–138). Indianapolis: Bobbs-Merrill.Google Scholar
  54. Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42, 230–265. (In The essential Turing (Copeland 2004a); page references are to the latter.)Google Scholar
  55. Turing, A. M. (1948). Intelligent machinery. National Physical Laboratory report. In The essential Turing (Copeland 2004a). A digital facsimile of the original document may be viewed in the Turing Archive for the History of Computing. http://www.AlanTuring.net/intelligent_machinery.
  56. Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433–60. (In The essential Turing (Copeland 2004a); page references are to the latter.)Google Scholar
  57. Weyl, H. (1927). Philosophie der Mathematik und Naturwissenschaft. Munich: R. Oldenbourg.MATHGoogle Scholar
  58. Weyl, H. (1949). Philosophy of mathematics and natural science. Princeton: Princeton University Press.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.University of CanterburyChristchurchNew Zealand
  2. 2.Hebrew University of JerusalemJerusalemIsrael

Personalised recommendations