Skip to main content

What Would Alan Turing Have Done After 1954?

  • Chapter

Summary

Incomplete aspects of Turing’s work are surveyed, with particular reference to his late interest in the foundations of quantum mechanics, and refuting the assertion that his work raised the prospect of constructing physical “oracle-machines.”

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bates, M. A. (1950). On the mechanical solution of a problem in Church’s lambda-calculus, M.Sc. thesis, Manchester University, October 1950.

    Google Scholar 

  2. Chaitin, G. J. (1982). Gödel’s Theorem and Information, International Journal of Theoretical Physics, 22, 941–954

    Article  MathSciNet  Google Scholar 

  3. Church, A. (1937). Review of [30]. J. Symbolic Logic. 2, 42–43.

    Article  Google Scholar 

  4. Church, A. (1937). Review of Post (1936). J. Symbolic Logic. 2, 43.

    Google Scholar 

  5. Church, A. (1940). On the concept of a random sequence, Bull. Amer. Math. Soc. 46, 130–5.

    Article  MathSciNet  Google Scholar 

  6. Copeland, B. J. (1997). The Church-Turing thesis, in E. N. Zalta (ed.), Stanford Encyclopaedia of Philosophy, http://plato.Stanford.edu.

    Google Scholar 

  7. Copeland B. J. and D. Proudfoot (1998). Enigma variations (London: Times Literary Supplement, 3 July 1998.)

    Google Scholar 

  8. Copeland B. J. and D. Proudfoot (1999). Alan Turing’s forgotten ideas in computer science. Scientific American, 253:4, 98–103.

    Article  Google Scholar 

  9. Copeland B. J. (1999). A lecture and two radio broadcasts on machine intelligence by Alan Turing, in Machine Intelligence 15, K. Furukawa, D. Michie. and S. Muggleton (eds.), Oxford University Press, Oxford.

    Google Scholar 

  10. Copeland B. J. and D. Proudfoot (1999). Review of The Legacy of Alan Turing, Mind, 108, 187–195.

    Google Scholar 

  11. Copeland, B. J. (2000). Narrow versus Wide Mechanism: Including a Reexamination of Turing’s Views on the Mind-Machine Issue. J. of Phil. 96, 5–32.

    Article  MathSciNet  Google Scholar 

  12. Davis, M. (1958). Computability and Unsolvability (New York: McGraw-Hill); with appendix on Hubert’s Tenth Problem, Dover edition (1982)

    MATH  Google Scholar 

  13. 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, 183–212.

    Google Scholar 

  14. Egan, G. (2000). Oracle, Asimov’s Science Fiction, July 2000.

    Google Scholar 

  15. Elitzur, A. C. and L. Vaidman (1993). Quantum-mechanical interact ion-free measurements, Found, of Physics 23, 987–97

    Article  Google Scholar 

  16. Feferman, S. (1988). Turing in the Land of O(Z), in [19]; an updated version appears in [39].

    Google Scholar 

  17. Gandy, R. O. (1954). Letter to M. H. A. Newman, in the Turing Archive, King’s College, Cambridge; included in [39].

    Google Scholar 

  18. Gandy, R. O. (1980). Principles of Mechanisms, in The Kleene Symposium, eds. J. Barwise, H. J. Keisler and K. Kunen, North-Holland, Amsterdam.

    Google Scholar 

  19. Herken R. (ed.) (1988). The universal Turing machine: a half-century survey, Kammerer und Unverzagt, Berlin; Oxford University Press, Oxford.

    MATH  Google Scholar 

  20. Hodges, A. (1983). Alan Turing: the enigma (Burnett, London; Simon Sz Schuster, New York; new editions Vintage, London, 1992, Walker, New York, 2000). Further material is on http://www.turing.org.uk.

    MATH  Google Scholar 

  21. Hodges, A. (1997). Turing, a natural philosopher (Phoenix, London; Routledge, New York, 1999). Included in: The Great Philosophers (eds. R. Monk and F. Raphael, Weidenfeld and Nicolson 2000)

    Google Scholar 

  22. Hodges, A. (2002). Alan M. Turing, in E. N. Zalta (ed.), Stanford Encyclopaedia of Philosophy, http://plato. Stanford.edu.

    Google Scholar 

  23. Hodges, A. (2003). Alan Turing and the Turing Test, in The Turing Test Sourcebook: Philosophical and Methodological Issues in the Quest for the Thinking Computer, ed. Robert Epstein, forthcoming.

    Google Scholar 

  24. Newman, M. H. A. (1951). The influence of automatic computers on mathematical methods, Manchester University Computer Inaugural Conference, July 1951.

    Google Scholar 

  25. Penrose, R. (1989). The emperor’s new mind, Oxford University Press, Oxford.

    Google Scholar 

  26. Penrose, R. (1994). Shadows of the mind, Oxford University Press, Oxford.

    Google Scholar 

  27. Turing, A. M. (1932). Handwritten essay, Nature of Spirit, photocopy in the Turing Archive, King’s College, Cambridge; see [20, p. 63].

    Google Scholar 

  28. Turing A. M. (1933). Letter to Sara Turing, 16 October 1933, in the Turing Archive, King’s College Cambridge; see [20, p. 79].

    Google Scholar 

  29. Turing A. M. (1936). Letter to Sara Turing, 14 October 1936, in the Turing Archive, King’s College Cambridge; see [20, p. 120].

    Google Scholar 

  30. Turing A. M. (1936–7). On computable numbers, with an application to the Entscheidungsproblem, Proc. London Maths. Soc, ser. 2, 42, 230–265; also in M. Davis, (ed.) The Undecidable (Raven, New York, 1965), and in [40]

    MathSciNet  Google Scholar 

  31. Turing A. M. (1939). Systems of Logic defined by Ordinals, Proc. Lond. Math. Soc, ser. 2, 45, 161–228; also in M. Davis (ed.). The Undecidable (Raven, New York, 1965). and in [40]. This was Turing’s 1938 Ph.D. thesis, Princeton University.

    Article  MathSciNet  Google Scholar 

  32. Turing, A. M. (1946). Proposed electronic calculator, unpublished report for National Physical Laboratory, London; published in A. M. Turing’s ACE Report of 1946 and other papers (eds. B. E. Carpenter and R. W. Doran, MIT Press, Cambridge, MA, 1986), and in [39].

    Google Scholar 

  33. Turing, A. M., 1947, Lecture to the London Mathematical Society on 20 February 1947, published in A. M. Turing’s ACE report of 1946 and other papers, (eds. B. E. Carpenter and R. W. Doran, MIT Press, Cambridge, MA, 1986), and in [39].

    Google Scholar 

  34. Turing A. M. (1948). Intelligent machinery, unpublished report for National Physical Laboratory, London; published (ed. D. Michie) in Machine Intelligence 7, 1969, and in [39].

    Google Scholar 

  35. Turing A. M., (1950). The word problem in semi-groups with cancellation, Ann. of Math. 52 (2), 491–505.

    Article  MathSciNet  MATH  Google Scholar 

  36. Turing A. M. (1950). Computing machinery and intelligence, Mind 49, 433–460, reprinted in [39].

    Article  MathSciNet  Google Scholar 

  37. Turing, A. M. (1951). BBC radio talk, transcript in the Turing Archive, King’s College, Cambridge; published in Machine Intelligence 15, eds. K. Furukawa, D. Michie. and S. Muggleton, Oxford University Press, Oxford, 1999.

    Google Scholar 

  38. Turing, A. M. (1954). Solvable and unsolvable problems, Science News 31, 7–23.

    Google Scholar 

  39. Turing, A. M. (1992). Collected Works: Mechanical Intelligence. D.C. Ince, ed., North-Holland, Amsterdam.

    Google Scholar 

  40. Turing, A. M. (2001). Collected Works: Mathematical Logic. R. O. Candy and C. E. M. Yates, eds., North-Holland, Amsterdam.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hodges, A. (2004). What Would Alan Turing Have Done After 1954?. 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_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05642-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05744-1

  • Online ISBN: 978-3-662-05642-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics