Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Philosophical Explorations of the Legacy of Alan Turing

Part of the book series: Boston Studies in the Philosophy and History of Science ((BSPS,volume 324))

Abstract

An overview of essays in this volume, with an emphasis on the philosophical legacy of Turing’s work, specifically the ways in which it bridges not only the gap between the sciences and the humanities, but also foundational and practical aspects of science and everyday life. Three sections of the volume are outlined, framing the overarching structure of Turing’s intellectual development: (i) Turing on the foundations of mathematics, incompleteness, the limits of analysis; (ii) Turing’s Universal Machine, implying the ubiquity of computational processes in our world, exemplified by applications in the early history of voice encryption, the history of computer music, the frontiers of computation, and the topic of emergence; (iii) Turing’s work on machines and mind, including his famed “Turing test” as a societal mechanism, the nature of perception as cognition, his views on freedom of the will and the integration of human and machine intelligence, and the developing idea of social algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Hodges (1983/2012), Chap. 1).

  2. 2.

    Hodges (1983/2012) passim. Later on in his life, one Manchester Philosophy Department event organized by Dorothy Emmet went on past midnight: see Lyn Irvine as quoted in the Foreword to the first edition of Sarah Turing (1959/2012). Moreover, Bertrand Russell, who would nominate Turing (with M.H.A. Newman) to become a Fellow of the Royal Society in the spring of 1951 also sent Turing greetings on the occasion of at least one of his London lectures as a young man. Cf. Sarah Turing (1959/2012), pp. 45,99.

  3. 3.

    See his mother S. Turing’s memoir (1959/2012) and Hodges (1983/2012), as well as Proudfoot Chap. 12. S. Turing (1959/2012), though she cannot be said to have understood her son, held that Turing was “in limited agreement with Christianity” as a kind of behaviorial device (p. 40), though Hodges (1983/2012) describes him as having lost faith.

  4. 4.

    The postcard contents are reproduced in Turing and Gandy and Yates (eds.) (1992), pp. 265–9 with helpful commentary; cf. Hodges (1983/2012). See Cooper Chap. 10, Fig. 10.3.

  5. 5.

    Hodges (1983/2012), p. 88; cf. S. Turing (1959/2012), p. 42; cf. a discussion in Floyd (2012a) and Chap. 5.

  6. 6.

    Discussions of this idea of autonomy may be found in Detlefsen (1986), Franks (2009), and Sieg (2013). See Floyd (Chap. 4) below for discussion.

  7. 7.

    Hodges (1983/2012); cf. Floyd Chap. 5.

  8. 8.

    Wittgenstein (1979), cf. Floyd Chap. 5.

  9. 9.

    Zabell (1995), (2013), cf. Hodges (1983/2012), p. 88.

  10. 10.

    Good (1979, 2000a, b); cf. Hodges (2003).

  11. 11.

    Newman (1955), cf. Grattan-Guinness (2013).

  12. 12.

    Hodges (1983/2012), pp. 96–100.

  13. 13.

    Gödel’s (1930) proof of the completeness theorem of first-order logic showed that a sentence is valid if and only if it can be deduced from the axioms of first-order logic, so that the Entscheidungsproblem may be regarded as asking for a “definite method” to decide whether a given statement is provable from the axioms using the rules of logic alone, i.e., whether it is valid in every structure satisfying the axioms of that system.

  14. 14.

    Franzén (2005) contains a crisp exposition of the theorem, discussing at length what it does and does not show.

  15. 15.

    Of course partial consistency results of fragments of arithmetic might still be sought, and so they were, among others by Turing.

  16. 16.

    Cf. Hodges (1983/2012).

  17. 17.

    See the Postscriptum (1964) to Gödel (1934), Gödel (1967) and compare Kennedy Chap. 3 for further discussion.

  18. 18.

    Cf., e.g., Davis (1987).

  19. 19.

    Hodges (2013).

  20. 20.

    On this see Davis (1982), Sieg (2009), Mundici and Sieg Chap. 2 and Kennedy Chap. 3.

  21. 21.

    See Kleene (1981a, b) discussed in Kennedy Chap. 3.

  22. 22.

    See Gandy (1988), Duwell Chap. 8.

  23. 23.

    Herken (1988), Olszewski, Wolenski and Janusz (eds.) (2008), Copeland, Posy and Shagrir (eds.) (2013); cf. Copeland (2009) for an introduction.

  24. 24.

    Controversy has arisen over Turing’s role in stimulating von Neumann, who authored in late June 1944 the “First Draft of a Report on the EDVAC” (which defined the critical “stored program” concept), and in aiding the development of the “Manchester Baby”. See Davis (2000/2011), Copeland (2006) and Copeland (2011a, 2011b), 2012) as well as Dyson (2012).

  25. 25.

    A useful explanation of the significance of the dissertation is given by Feferman (1988) who developed Turing’s work (1962). Further relevant commentary and correspondence is to be found in in Copeland (2004), pp. 125–204 and Cooper and van Leeuven (eds.) (2013), pp. 145–210.

  26. 26.

    Cf. Mundici and Sieg, Chap. 2.

  27. 27.

    Hodges (1983/2012), (2013).

  28. 28.

    See Blum (2013) on this.

  29. 29.

    Turing (c.1940), Hodges (1983/2012), Kahn (1991, 1996), Hinsley and Stripp (eds.) (1993), Copeland (2006).

  30. 30.

    Davis (2000/2011), Copeland (2011a), (2011b), (2012); cf. Davis’s Chap. 5, Copeland and Long Chap. 8.

  31. 31.

    Turing, Gandy and Yates (eds.) (2001), pp. 179, 266.

  32. 32.

    Discussed in Copeland (2011a), (2011b), (2012).

  33. 33.

    See, for discussion, Copeland (2004, 2006, 2011a, b, 2012) and Copeland and Long Chap. 8.

  34. 34.

    Turing (1949), cf. Jones (2013).

  35. 35.

    See Winston’s Chap. 10 for a discussion.

  36. 36.

    The Introduction to Turing’s (1950b) in Copeland (2004) pp. 433–440 shares some of the history of earlier framings of the test that are due to Turing. More on the parameters of the Turing Test may be gleaned from papers in Moor (2003) and Shieber (2004), as well as the commentaries on Turing (1950b) in Cooper and van Leeuven (eds.) (2013), pp. 551–622. Cf. Oppy and Dowe (2011) for an overview.

  37. 37.

    Cf. Turing and Saunders (1992).

  38. 38.

    According to Beebe’s bibliography (March 15, 2015), discussed below in Sect. 1.4.

  39. 39.

    Hodges (1983/2012), note 8.46; cf. Sommaruga and Strahm (2015).

  40. 40.

    Davis and Sieg (2015).

  41. 41.

    See Putnam (1988), Searle (1992).

  42. 42.

    See Stachel (2012) for an elaboration of such a view.

  43. 43.

    See Dreyfus (1972, 1992); Searle (1984, 1992).

  44. 44.

    See Parikh (2001, 2002), Pacuit and Parikh (2006).

  45. 45.

    For an overview of some of the issues, see Hendricks and Symons (2014).

  46. 46.

    http://www.turing.org.uk/sources/biblio.html, http://www.turing.org.uk/index.html

  47. 47.

    http://ftp.math.utah.edu/pub//bibnet/authors/t/turing-alan-mathison.html

  48. 48.

    www.alanturing.net

  49. 49.

    http://www.turingarchive.org/about/

  50. 50.

    Turing and Britton (1992), Turing and Ince (1992), Turing and Saunders (1992), Turing and Gandy and Yates (2001)).

  51. 51.

    http://www.turing-gateway.cam.ac.uk/about.shtml

  52. 52.

    https://turing.ac.uk/

  53. 53.

    http://www.mathcomp.leeds.ac.uk/turing2012/

  54. 54.

    Cf. also Brooks (2001).

References

  • Becher, V., S. Figueria, and R. Picchi. 2007. Turing’s unpublished algorithm for normal numbers. Theoretical Computer Science 377: 126–138.

    Google Scholar 

  • Blum, L. 2013. Alan Turing and the Other Theory of Computation, Commentary on Turing (1948a) in Cooper and van Leeuven (eds.) 377–384.

    Google Scholar 

  • Brooks, R. 2001. The Relationship Between Matter and Life. Nature 409: 409–411.

    Article  Google Scholar 

  • Church, A. 1936. An Unsolvable Problem of Elementary Number Theory. American Journal of Mathematics 58: 345–363.

    Article  Google Scholar 

  • ———. 1937. Review of Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem”, The Journal of Symbolic Logic 2: 42–43. Reprinted with Commentary by A. Hodges in Cooper and van Leeuven (eds.) (2013), 117–120.

    Google Scholar 

  • Cooper, B.S., and van Leeuven (eds.). 2013. Alan Turing: His Work and Impact, Amsterdam/Waltham: Elsevier.

    Google Scholar 

  • Copeland, B.J. 2009. Spring edition of The Stanford Encyclopedia of Philosophy, “Church-Turing”: http://plato.stanford.edu/archives/spr2009/entries/church-turing/.

  • ———. 2011a. The Manchester Computer: A Revised History, Part I: The Memory. IEEE Annals of the History of Computing 33 (1): 4–21.

    Article  Google Scholar 

  • ———. 2011b. The Manchester Computer: A Revised History, Part 2: The Baby Computer. IEEE Annals of the History of Computing 33 (1): 22–37.

    Article  Google Scholar 

  • ———. 2012. Turing: Pioneer of the Information Age. Oxford: Oxford University Press.

    Google Scholar 

  • ———. (ed.). 2004. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life. Oxford, Clarendon Press.

    Google Scholar 

  • ———. (ed.). 2006. Colossus: The Secrets of Bletchley Park’s Codebreaking Computers. Oxford: Oxford University Press.

    Google Scholar 

  • Copeland, B.J., C.J. Posy, and O. Shagrir (eds.). 2013. Computability: Turing, Gödel, Church, and Beyond, Cambridge, MA: MIT Press.

    Google Scholar 

  • Davis, M. 1982. Why Gödel Didn’t Have Church’s Thesis. Information and Control 54: 3–24.

    Article  Google Scholar 

  • ———. 1987. Mathematical Logic and the Origin of Modern Computers. In Studies in the History of Mathematics, 137–165. Washington, DC: Mathematical Association of America. Reprinted in Herken (ed.) (1988), 149–174.

    Google Scholar 

  • ———. 2000/2011. The Universal Computer: The Road from Leibniz to Turing. New York: Norton, AK Peters, CRC, Taylor & Francis.

    Google Scholar 

  • Davis, M., ed. 1965/2004. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. New York: Raven Press/Dover Publications.

    Google Scholar 

  • Davis, M., and W. Sieg. 2015. Conceptual Confluence in 1936: Post and Turing, in G. Sommaruga and T. Strahm (eds.), 3–28.

    Google Scholar 

  • Detlefsen, M. 1986. Hilbert’s Program: An Essay on Mathematical Instrumentalism, Springer Library. Springer: Dordrecht.

    Book  Google Scholar 

  • Dreyfus, H.L. 1972. What Computers Can’t Do: A Critique of Artificial Reason. New York: Harper & Row.

    Google Scholar 

  • ———. 1992. What Computers Still Can’t Do: A Critique of Artificial reason. Cambridge, MA: MIT Press.

    Google Scholar 

  • Dyson, G. 2012. Turing’s Cathedral: The Origins of the Digital Universe. New York: Pantheon Books.

    Google Scholar 

  • Feferman, S. 1962. Transfinite Recursive Progressions of Axiomatic Theories. The Journal of Symbolic Logic 27 (3): 259–316.

    Article  Google Scholar 

  • ———. 1988. Turing in the Land of O(z), in R. Herken (ed.) (1988), 113–147.

    Google Scholar 

  • Franks, C. 2009. The Autonomy of Mathematical Knowledge: Hilbert’s Program Revisited. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Franzén, T. 2005. Gödel’s Theorem: An Incomplete Guide to Its Use and Abuse. A.K. Peters: Wellesley.

    Book  Google Scholar 

  • Gandy, R.O. 1988. The Confluence of Ideas in 1936, in Herken, R. (ed.), (1988), 55–112.

    Google Scholar 

  • Gettier, E.L. 1963. Is Justified True Belief Knowledge? Analysis 23 (6): 121–123.

    Article  Google Scholar 

  • Gödel, K. 1930. The Completeness of the Axioms of the Functional Calculus of Logic. In Kurt Gödel Collected Works Volume I: Publications 1929-1936, eds. S. Feferman, et.al., 103–123. New York/Oxford:Oxford University Press, 1986. Original publication “Die Vollstandigkeit der Axiome des logischen Funktionenkalküls”, Monatshefte fur Mathematik und Physik 37: 349–360.

    Google Scholar 

  • ———. 1931. On Formally Undecidable Propositions of Principia Mathematica and Related Systems I. In Kurt Gödel Collected Works: Vol. I, Publications 1929–1936, ed. S. Feferman et.al., 145–195. New York: Oxford University Press, 1986.

    Google Scholar 

  • ———. 1934. On Undecidable Propositions of Formal Mathematical Systems. In Kurt Gödel Collected Works, Vol. I: Publications 1926–1936, ed. S. Feferman, 346–372. New York/Oxford: Oxford University Press.

    Google Scholar 

  • ———. 1946. Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics. In Kurt Gödel Collected Works, Vol. II: Publications 1938–1974, eds. S. Feferman et.al., 150–153. New York: Oxford University Press, 1990.

    Google Scholar 

  • ———. 1956. Letter to von Neumann, 20 March 1956, in Kurt Gödel Collected Works. V: Correspondence H-Z, eds. S. Feferman et al., 372–375. Oxford: Oxford University Press, 2003.

    Google Scholar 

  • ———. 1964. Postscriptum to the 1934 Princeton Lectures. In Kurt Gödel Collected Works Vol. I: Publications 1929–1936, eds. S. Feferman, et al., 369–370. New York: Oxford University Press, 1986.

    Google Scholar 

  • Good, I.J. 1979. A.M. Turing’s Statistical Work in World War II, Studies in the History of Probability and Statistics. XXXVII. Biometrika 66, 2, 393–396. Reprinted in Turing and J.L. Britton (eds.) 1992, 207–210.

    Google Scholar 

  • ———. 2000a. Turing’s Anticipation of Empirical Bayes in Connection with the Cryptanalysis of the Naval Enigma. Journal of Statistical Computation and Simulation 66: 101–111.

    Article  Google Scholar 

  • ———. 2000b. Introductory Remarks for Good (1979), in Turing and Britton J. (eds.) (1992), 211–223.

    Google Scholar 

  • Grattan-Guinness, I. 2013 The Mentor of Alan Turing: Max Newman (1897–1984) as a Logician. The Mathematical Intelligencer 35: 54–63.

    Google Scholar 

  • Hilbert, D. 1900. Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris. Nachrichten der Königlichen Gesellschaft der Wissenschaften zu Göttingen 253–297. Reprinted, with additions, in Archiv der Mathematik und Physik series 3, 1 (1901), 44–63, 213–237. Translated by Mary Winston Newson in Bulletin of the American Mathematical Society Series 2, 8 (1902), 437–479; Selections Reprinted as 1900b in From Kant to Hilbert, Vol. 2, ed. W. Ewald, 1096–1105. Oxford/New York: Oxford University Press.

    Google Scholar 

  • Herken, R. (ed.). 1988. The Universal Turing Machine: A Half-Century Survey. Oxford/New York: Oxford University Press.

    Google Scholar 

  • Hendricks, V., and J. Symons. 2014. Epistemic Logic. Stanford Encyclopedia of Philosophy, spring 2014, at http://plato.stanford.edu/archives/spr2014/entries/logic-epistemic/.

  • Hinsley, E.H., and A. Stripp (eds.). 1993. Codebreakers: The Inside Story of Bletchley Park. Oxford: Oxford University Press.

    Google Scholar 

  • Hodges, A. 1983/2012. Alan Turing the Enigma of Intelligence. New York/Princeton: Touchstone/Princeton University Press.

    Google Scholar 

  • ———. 2003. The Military Use of Alan Turing. In Mathematics and War, B. Boß-Bavnbek and J. Høyrup (eds.), 312–325. Boston: Birkhäuser.

    Google Scholar 

  • ———. 2013. Commentary on Church (1937) in Cooper and van Leeuven (eds.), (2013), 117–118.

    Google Scholar 

  • Jones, C.B. 2013. Turing’s (1949) ‘Checking a Large Routine’, in Cooper and van Leeuven (eds.), (2013), 455–460.

    Google Scholar 

  • Kahn, D. 1991. Seizing the Enigma: The Race to Break the German U-Boat Codes, 1939–1943. Boston: Houghton Mifflin Company.

    Google Scholar 

  • ———. 1996. The Codebreakers: The Story of Secret Writing (Revised ed.). New York: Scribner.

    Google Scholar 

  • Kleene, S.C. 1981a. Origins of Recursive Function Theory. Annals of the History of Computing 3 (1): 52–67.

    Article  Google Scholar 

  • ———. 1981b. The Theory of Recursive Functions, Approaching its Centennial. American Mathematical Society, Bulletin, New Series 5 (1): 43–61.

    Article  Google Scholar 

  • Moor, J.H. (ed.). 2003. The Turing Test. Dordrecht: Kluwer.

    Google Scholar 

  • Newman, M.H.A. 1955. Alan Mathison Turing. 1912–1954. Biographical Memoirs of Fellows of the Royal Society 1: 253–263.

    Article  Google Scholar 

  • Olszewski, A., J. Wolenski, and R. Janusz (eds.). 2008. Church’s Thesis After 70 Years. Ontos Mathematical Logic. Frankfurt: Ontos.

    Google Scholar 

  • Oppy, G., and D. Dowe. 2011. The Turing Test. Stanford Encyclopedia of Philosophy spring 2011, at http://plato.stanford.edu/archives/spr2011/entries/turing-test/.

  • Pacuit, E., and R. Parikh. 2006. Social Interaction, Knowledge, and Social Software. In Interactive Computation: The New Paradigm, D. Goldin, S. Smolka, and P. Wegner (eds.). New York: Springer.

    Google Scholar 

  • Parikh, R. 2001. Language as Social Software. In Future Pasts: The Analytic Tradition in Twentieth Century Philosophy, J. Floyd and S. Shieh (eds.), 339–350. New York: Oxford University Press.

    Chapter  Google Scholar 

  • Petzold, C. 2008. The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine. Indianapolis: Wiley Publishing, Inc..

    Google Scholar 

  • Plato. 1997. Complete Works, ed. John M. Cooper. Indianapolis: Hackett Publishing.

    Google Scholar 

  • Post, E.L. 1936. Finite Combinatory Processes, Formulation 1. The Journal of Symbolic Logic 1: 103–105.

    Article  Google Scholar 

  • Putnam, H. 1988. Representation and Reality. Cambridge: MIT Press.

    Google Scholar 

  • Russell, B. 1912/1990. The Problems of Philosophy. Indianapolis, Hackett Publishing Co. Originally published by The Home University Library of Modern Knowledge.

    Google Scholar 

  • Searle, J.R. 1984. Minds, Brains and Science: The 1984 Reith Lectures. Cambridge, MA: Harvard University Press.

    Google Scholar 

  • ———. 1992. The Rediscovery of Mind. Cambridge, MA: MIT Press.

    Book  Google Scholar 

  • Shieber, S. (ed.). 2004. The Turing Test: Verbal Behavior as the Hallmark of Intelligence. Cambridge, MA: MIT Press.

    Google Scholar 

  • Sieg, W. 2009. On Computability. In Philosophy of Mathematics, Handbook of the Philosophy of Science Series, ed. A.D. Irvine, 535–630. Amsterdam/Boston/Oxford: Elsevier.

    Chapter  Google Scholar 

  • ———. 2013. Hilbert’s Programs and Beyond. Oxford/New York: Oxford University Press.

    Google Scholar 

  • Stachel, J. 2012 Where is Knowledge?. In Frontiers of Fundamental Physics/the Eleventh International Symposium, AIP Conference Proceedings, ed. Joseph Kouneiher et al., vol. 1446, 312–334. Melville: American Institute of Physics.

    Google Scholar 

  • Sommaruga, G., and T. Strahm (eds.). 2015. Turing’s Revolution: The Impact of His Ideas About Computability. Basel: Birkhäuser/Springer.

    Google Scholar 

  • Turing, A.M. 1935a. On the Gaussian Error Function. Unpublished Fellowship Dissertation, King’s College Library, Cambridge, available in the Turing Digital Archive as AMT/C/28 at http://www.turingarchive.org/browse.php/C/28

  • ———. 1935b. Equivalence of Left and Right Almost Periodicity. Journal of the London Mathematical Society 10: 284–285. Reprinted in Turing and Britton (eds.) (1992), 1–2.

    Google Scholar 

  • ———. 1936/1937. On Computable Numbers, with an Application to the Decision Problem. In Proceedings of the London Mathematical Society 2(42): 230–265. Correction: “On Computable Numbers, with an Application to the Decision Problem: A Correction” (1937), Proceedings of the London Mathematical Society, 2 (42) (1937), 230–265. Both reprinted with Commentary in Davis (ed.) (1965/2004), 115–153; Turing, and Gandy, R.O. and Yates, C.E.M. (eds.), (2001), 18–53; Copeland, J. (ed.) (2004), 58–90; Petzold, C. (2008); Cooper and van Leeuven eds. (2013), 16–41.

    Google Scholar 

  • ———. 1937a. Computability and λ-definability. Journal of Symbolic Logic 2: 153–163. Reprinted in Turing and Gandy and Yates (eds.) (2001), 59–69.

    Google Scholar 

  • ———. 1937b. The p-function in λ-K Conversion. The Journal of Symbolic Logic 2 (1937): 164.

    Article  Google Scholar 

  • ———. 1938a. Finite Approximations to Lie Groups. Annals of Mathematics, Princeton 39: 105–111. Reprinted in Turing and Britton (eds.) (1992), 3–10.

    Google Scholar 

  • ———. 1938b. The Extensions of a Group. Compositio Mathematica 5: 357–367. Reprinted in Turing and Britton (eds.) (1992), 11–22.

    Google Scholar 

  • ———. 1938c/2012. Systems of Logic Based on Ordinals. Dissertation, Princeton University 1938. Published in Alan Turing’s Systems of Logic: The Princeton Thesis (ed.) A. Appel (Oxford and Princeton, Princeton University Press).

    Google Scholar 

  • ———.1939. Systems of Logic based on Ordinals. Proceedings of the London Mathematical Society 2(45): 161–228. Reprinted in Turing and Gandy and Yates (eds.) (2001), 81–148.

    Google Scholar 

  • ———. 1941. Some Theorems About Church’s System. Unpublished manuscripts, in Turing and Gandy and Yates (eds.) (2001), 201–206.

    Google Scholar 

  • ———. 1942. The Use of Dots as Brackets in Church’s System. The Journal of Symbolic Logic 7: 146–115.

    Article  Google Scholar 

  • ———. c.1940. “Treatise on the Enigma”, Known as “Prof’s Book”. Xerox TS, Part of the records of the National Security Agency transferred to US National Archives and Records Administration in Apr. 1995. Paper, 61 sh. in envelope. Available online at the Turing Digital Archive (http://www.turingarchive.org/browse.php/C/30) as AMT/C/30. Excerpted with commentary in Turing and Gandy and Yates (eds.) (2001) 223–258 and in Cooper and van Leeuven (eds.) (2013), 413–425. Ch. 6 reprinted with related correspondence and commentary in Copeland 2004, 311–352.

    Google Scholar 

  • ———. 1943. A Method for the Calculation of the Zeta-Function. Proceedings of the London Mathematical Society 2(48): 180–197. Reprinted in Turing and Britton (eds.) (1992), 23–40.

    Google Scholar 

  • ———. 1943/1944. Practical Forms of Type Theory II. Unpublished paper in Turing and Gandy and Yates (eds.) (2001), 207–211.

    Google Scholar 

  • ———. 1944/1945. The Reform of Mathematical Notation and Phraseology. Unpublished paper in Turing and Gandy and Yates (eds.) (2001), 211–222. Reprinted in Cooper and van Leeuwen (eds.) (2013), 245–249.

    Google Scholar 

  • ———. 1945/1992. Proposals for development in the Mathematics Division for an Automatic Computing Engine (ACE), Report to the Executive Committee of the National Physics Laboratory, in Turing and D.C. Ince (ed.) (1992), 1–86. Originally published in B.E. Carpenter and R.N. Doran (eds.), A.M. Turing’s ACE Report of 1946 and Other Papers, Cambridge, MA 1986, 20–105.

    Google Scholar 

  • ———. 1947/1992. Lecture on the Automatic Computing Engine, given to the London Mathematical Society 20 February 1947, in Turing and Ince (eds.) (1992), 87–106. Originally published in B.E. Carpenter and R.N. Doran (eds.), A.M. Turing’s ACE Report of 1946 and Other Papers, Cambridge, MA 1986, 106–124.

    Google Scholar 

  • ———. 1948a/1992. Rounding-off Errors in Matrix Processes. Quarterly Journal of Mechanics and Applied Mathematics 1: 287–308. Reprinted in Turing and Britton (eds.) (1992), 41–62.

    Google Scholar 

  • ———. 1948b. Practical Forms of Type Theory. The Journal of Symbolic Logic 13: 80–94. Reprinted in Turing and Gandy and Yates (eds.) (2001), 179–202.

    Google Scholar 

  • ———. 1948c/1992. “Intelligent machinery”, in Turing and Ince (ed.) (1992), 107–128. Report, National Physics Laboratory, originally published in B. Meltzer and D. Michie (eds.), Machine intelligence 5. Edinburgh: Edinburgh University Press, 1969, 3–23.

    Google Scholar 

  • ———. 1949. Checking a Large Routine. EDSAC Inaugural Conference 24 June 1949, Report of a conferernce on High Speed Automatic Calculating Machines: 67–69. Reprinted in Turing and Ince (eds.) (1992), 87–106.

    Google Scholar 

  • ———. 1950a. The Word Problem in Semi-groups with Cancellation. Annals of Mathematics 52 (2): 491–505. Reprinted in Turing and Britton (eds.) (1992), 63–78.

    Google Scholar 

  • ———. 1950b. Computing Machinery and Intelligence. Mind 59(October): 433–460. Reprinted in Turing and Ince (eds.) (1992), 133–160.

    Google Scholar 

  • ———. 1951a. Intelligent Machinery, A Heretical Theory, BBC, The ‘51 Society Radio Broadcast. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life. B. S. Cooper. Oxford: Oxford University Press, 465–475.

    Google Scholar 

  • ———. 1951b. Can Digital Computers Think? BBC Radio Broadcast, 15 May and 3 July 1951. Published in Copeland (2004), 476–486.

    Google Scholar 

  • ———. 1952. The Chemical Basis of Morphogenesis. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 237 (651): 37–52. Reprinted in Turing and Saunders (eds.) (1992), 1–36.

    Google Scholar 

  • ———. 1953a. Some Calculations of the Riemann Zeta-Function. Proceedings of the London Mathematical Society 3 (3): 99–117. Reprinted in Turing and Britton (eds.) (1992), 79–98.

    Google Scholar 

  • ———. 1953b. Digital Computers Applied to Games: Chess. In Faster Than Thought, ed. B.V. Bowden, 286–310. London: Pitman.

    Google Scholar 

  • ———. 1954. Solvable and Unsolvable Problems. Science News 31: 7–23. Reprinted in Turing and Britton (eds.) (1992), 99–116 and in Turing and Ince (eds.) (1992), 187–204.

    Google Scholar 

  • Turing, A.M. ?. On Permutation Groups, in Turing and Britton (eds.) (1992), 125–146.

    Google Scholar 

  • ———. 195?. Turing, A. M. Programmers’ Handbook for Manchester Electronic Computer Mark II, Computing Machine Laboratory, University of Manchester, no date, circa 1950. A digital facsimile is in The Turing Archive for the History of Computing at www.AlanTuring.net/programmers_handbook. Third edition prepared by Tony Brooker in 1953.

  • Turing, A.M., and M.H.A. Newman. 1942. A Formal Theorem in Church’s Theory of Types. The Journal of Symbolic Logic 7: 28–33.

    Article  Google Scholar 

  • Turing, A.M., R. Braithwaite, G. Jefferson, and M.H.A. Newman. 1952. Can Automatic Calculating Machines be Said to Think? BBC Radio Broadcast, 10 January 1952. Published in Copeland (2004), 486–506.

    Google Scholar 

  • Turing, A.M., and J.L. Britton (eds.). 1992. Collected Works of A.M. Turing: Pure Mathematics Amsterdam/New York: Elsevier.

    Google Scholar 

  • Turing, A.M., and D. Ince (eds.). 1992. Collected Works of A.M. Turing: Mechanical Intelligence. Amsterdam/New York: Elsevier.

    Google Scholar 

  • Turing, A.M., and P.T. Saunders (eds.). 1992. Collected Works of A.M. Turing: Morphogenesis. Amsterdam/New York: Elsevier.

    Google Scholar 

  • Turing, A.M., R.O. Gandy, and C.E.M. Yates (eds.). 2001. Collected Works of A.M. Turing: Mathematical Logic, Amsterdam/New York: Elsevier.

    Google Scholar 

  • Turing, S. 1959/2012. Alan M. Turing, Centenary Edition. Cambridge University Press.

    Google Scholar 

  • von Neumann, J. 1932/1968. Mathematische Grundlagen der Quantum Mechanik. Berlin: Springer.

    Google Scholar 

  • Wilkinson, J. 1971. Some Comments from a Numerical Analyst. Journal of the Association for Computing Machinery 18 (2): 137–147.

    Article  Google Scholar 

  • Wittgenstein, L. 1979. In Wittgenstein’s Lectures on the Foundations of Mathematics: Cambridge, 1939, ed. R.G. Bosanquet, N. Malcolm, R. Rhees, Y. Smythies, and C. Diamond. Chicago: University of Chicago Press.

    Google Scholar 

  • Zabell, S.L. 1995. Alan Turing and the Central Limit Theorem. The American Mathematical Monthly 102 (6): 483–494.

    Article  Google Scholar 

  • ———. 2013 Alan Turing and the Central Limit Theorem, in Cooper and van Leeuwen eds. (2013), 257–263.

    Google Scholar 

Download references

Acknowledgments

The author gratefully acknowledges comments on a late draft by Juliette Kennedy and Alisa Bokulich that crucially improved this Introduction, as well as John Stachel’s help in sharing helpful feedback on aspects of the papers entangled with physics and causality .

Author information

Authors and Affiliations

  1. Department of Philosophy, Boston University, 745 Commonwealth Avenue, Boston, MA, 02215, USA

    Juliet Floyd

Authors
  1. Juliet Floyd
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juliet Floyd .

Editor information

Editors and Affiliations

  1. Department of Philosophy, Boston University, Boston, MA, USA

    Juliet Floyd

  2. Department of Philosophy, Boston University, Boston, MA, USA

    Alisa Bokulich

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Floyd, J. (2017). Introduction. In: Floyd, J., Bokulich, A. (eds) Philosophical Explorations of the Legacy of Alan Turing. Boston Studies in the Philosophy and History of Science, vol 324. Springer, Cham. https://doi.org/10.1007/978-3-319-53280-6_1

Download citation

Publish with us

Policies and ethics

Search

Navigation