Linked bibliography for the SEP article "Turing Machines" by Liesbeth De Mol

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

Barwise, Jon and John Etchemendy, 1993, Turing’s World, Stanford, CA: CSLI Publications. (Scholar)
Boolos, George S. and Richard C. Jeffrey, 1974, Computability and Logic, Cambridge: Cambridge University Press; fifth edition 2007. doi:10.1017/cbo9780511804076 (fifth edition) (Scholar)
Bromley, Allan G., 1985, “Stored Program Concept. The Origin of the Stored Program Concept”, Technical Report 274, Basser Department of Computer Science, November 1985. [Bromley 1985 available online] (Scholar)
Bullynck, Maarten, Edgar G. Daylight, and Liesbeth De Mol, 2015, “Why Did Computer Science Make a Hero Out of Turing?”, Communications of the ACM, 58(3): 37–39.doi:10.1145/2658985 (Scholar)
Church, Alonzo, 1932, “A Set of Postulates for the Foundation of Logic”, Annals of Mathematics, 33(2): 346–366. doi:10.2307/1968337 (Scholar)
–––, 1933, “A Set of Postulates for the Foundation of Logic (Second Paper)”, Annals of Mathematics, 34(4): 839–864. doi:10.2307/1968702 (Scholar)
–––, 1936a, “An Unsolvable Problem of Elementary Number Theory”, American Journal of Mathematics, 58(2): 345–363. (Scholar)
–––, 1936b, “A Note on the Entscheidungsproblem”, Journal of Symbolic Logic, 1(1): 40–41. doi:10.2307/2269326 (Scholar)
–––, 1937, “Review of: On Computable Numbers with An Application to the Entscheidungsproblem by A.M. Turing”, Journal of Symbolic Logic, 2(1): 42–43. doi:10.1017/s002248120003958x (Scholar)
Cook, Matthew, 2004, “Universality in Elementary Cellular Automata”, Complex Systems, 15(1): 1–40. (Scholar)
Cooper, S. Barry and Jan Van Leeuwen, 2013, Alan Turing: His Work and Impact, Amsterdam: Elsevier. doi:10.1016/c2010-0-66380-2 (Scholar)
Copeland, B. Jack, 2002, “Accelerating Turing Machines”, Minds and Machines, 12(2): 281–301. doi:10.1023/a:1015607401307 (Scholar)
Copeland, B. Jack and Diane Proudfoot, 2011, “Alan Turing: Father of the Modern Computer”, The Rutherford Journal, 4: 1. [Copeland & Proudfoot 2011 available online] (Scholar)
Davis, Martin, 1958 [1982], Computability and Unsolvability, New York: McGraw-Hill. Reprinted Dover, 1982. (Scholar)
–––, 1965, The Undecidable. Basic papers on undecidable propositions, unsolvable problems and computable functions, New York: Raven Press. (Scholar)
–––, 1978, “What is a Computation?”, Lynn Arthur Steen (ed.), Mathematics Today: Twelve Informal Essays, New York: Springer, pp. 241–267. doi:10.1007/978-1-4613-9435-8_10 (Scholar)
–––, 1982, “Why Gödel Didn’t Have Church’s Thesis”, Information and Control, 54:(1–2): 3–24. doi:10.1016/s0019-9958(82)91226-8 (Scholar)
–––, 1988, “Mathematical Logic and the Origin of the Modern Computer”, in Herken 1988: 149–174. (Scholar)
–––, 1989, “Emil Post’s Contribution to Computer Science”, Proceedings of the Fourth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, pp. 134–137. doi:10.1109/lics.1989.39167 (Scholar)
Davis, Martin and Wilfried Sieg, 2015, “Conceptual Confluence in 1936: Post and Turing”, in Giovanni Sommaruga and Thomas Strahm (eds.), Turing’s Revolution: The Impact of His Ideas about Computability, Cham: Springer. doi:10.1007/978-3-319-22156-4_1 (Scholar)
Daylight, Edgar G., 2014, “A Turing Tale”, Communications of the ACM, 57(10): 36–38. doi:10.1145/2629499 (Scholar)
–––, 2015, “Towards a Historical Notion of ‘Turing—The Father of Computer Science’”, History and Philosophy of Logic, . 36(3): 205–228. doi:10.1080/01445340.2015.1082050 (Scholar)
De Mol, Liesbeth, 2013, “Generating, Solving and the Mathematics of Homo Sapiens. Emil Post’s Views On computation”, Hector Zenil (ed.), A Computable Universe. Understanding Computation & Exploring Nature As Computation, Hackensack, NJ: World Scientific, pp. 45–62. doi:10.1142/9789814374309_0003 [De Mol 2013 available online] (Scholar)
De Mol, Liesbeth, Maarten Bullynck, and Edgar G. Daylight, 2018, “Less is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950s”, IEEE Annals of the History of Computing, 40(1): 19–45. doi:10.1109/mahc.2018.012171265 [De Mol et al. 2018 available online] (Scholar)
Deutsch, D., 1985, “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer”, Proceedings of the Royal Society A, 400(1818): 97–117. doi:10.1098/rspa.1985.0070 (Scholar)
Dershowitz, Nachum and Yuri Gurevich, 2008, “ A Natural Axiomatization of Computability and Proof of Church’s Thesis”, Bulletin of Symbolic Logic, 14(3): 299–350. (Scholar)
Frankel, Stanley, 1956, “Useful Applications of a Magnetic-Drum Computer”, Electrical Engineering, 75(7): 634–39, doi:10.1109/ee.1956.6442018 (Scholar)
Gandy, Robin, 1980, “Church’s Thesis and Principles for Mechanism”, in Jon Barwise, H. Jerome Keisler, and Kenneth Kunen (eds.), The Kleene Symposium: Proceedings of the Symposium Held June 18–24, 1978 at Madison, Wisconsin, U.S.A., (Studies in Logic and the Foundations of Mathematics, 101), Amsterdam: North-Holland, pp. 123–148. doi:10.1016/s0049-237x(08)71257-6 (Scholar)
–––, 1988, “The Confluence of Ideas in 1936”, in Herken 1988: 55–111. (Scholar)
Gödel, Kurt, 1929, “Die Vollständigkeit der Axiome des logischen Funktionenkalkül”, Monatshefte für Mathematik und Physik, 37: 349–360. doi:10.1007/bf01696781 (Scholar)
–––, 1934, “On Undecidable Propositions of Formal Mathematical Systems”, mimeographed lecture notes by S. C. Kleene and J. B. Rosser, Institute for Advanced Study, Princeton, NJ; corrected and amplified in Davis 1965: 41–74. (Scholar)
Grier, David Alan, 2007, When Computers Were Human, Princeton, NJ: Princeton University Press. (Scholar)
Haigh, Thomas, 2013, “‘Stored Program Concept’ Considered Harmful: History and Historiography”, in Paola Bonizzoni, Vasco Brattka, and Benedikt Löwe, The Nature of Computation. Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1–5, 2013 Proceedings, (Lecture Notes in Computer Science, 7921), Berlin: Springer, pp. 241–251. doi:10.1007/978-3-642-39053-1_28 (Scholar)
–––, 2014, “Actually, Turing Did Not Invent the Computer”, Communications of the ACM, 57(1): 36–41. doi:10.1145/2542504 (Scholar)
Hamkins, Joel David and Andy Lewis, 2000, “Infinite Time Turing Machines”, Journal of Symbolic Logic, 65(2): 567–604. doi:10.2307/2586556 (Scholar)
Hartmanis, J. and R.E. Stearns, 1965, “On the Computational Complexity of Algorithms” Transactions of the American Mathematical Society, 117: 285–306. doi:10.1090/s0002-9947-1965-0170805-7 (Scholar)
Herken, Rolf, (ed.), 1988, The Universal Turing Machine: A Half-Century Survey, New York: Oxford University Press. (Scholar)
Hilbert, David, 1930, “Naturerkennen und Logik”, Naturwissenschaften, 18(47–49): 959–963. doi:10.1007/bf01492194 (Scholar)
Hilbert, David and Wilhelm Ackermann, 1928, Grundzüge der Theoretischen Logik, Berlin: Springer. doi:10.1007/978-3-642-65400-8 (Scholar)
Hodges, Andrew, 1983, Alan Turing: The Enigma, New York: Simon and Schuster. (Scholar)
Kleene, Stephen Cole, 1936, “General Recursive Functions of Natural Numbers”, Mathematische Annalen, 112: 727–742. doi:10.1007/bf01565439 (Scholar)
–––, 1943, “Recursive predicates and quantifiers”, Transactions of the American Mathematical Society, 53(1): 41–73. doi:10.2307/2267986 (Scholar)
–––, 1952, Introduction to Metamathematics, Amsterdam: North Holland. (Scholar)
Lambek, Joachim, 1961, “How to Program an Infinite Abacus”, Canadian Mathematical Bulletin, 4: 295–302. doi:10.4153/cmb-1961-032-6 (Scholar)
Lewis, Henry R. and Christos H. Papadimitriou, 1981, Elements of the Theory of Computation, Englewood Cliffs, NJ: Prentice-Hall. (Scholar)
Lin, Shen and Tibor Radó, 1965, “Computer Studies of Turing Machine Problems”, Journal of the Association for Computing Machinery, 12(2): 196–212. doi:10.1145/321264.321270 (Scholar)
Mancosu, Paolo, Richard Zach, and Calixto Badesa, 2009, “The Development of Mathematical Logic from Russell to Tarski, 1900–1935”, in Leila Haaparanta (ed.), The Development of Modern Logic, New York: Oxford University Press, pp. 318–470. doi:10.1093/acprof:oso/9780195137316.003.0029 [Mancosu et al. 2009 available online] (Scholar)
Margenstern, Maurice, 2000, “Frontier Between Decidability and Undecidability: A Survey”, Theoretical Computer Science, 231(2): 217–251. doi:10.1016/s0304-3975(99)00102-4 (Scholar)
McCarthy, John, 1963, “A Basis for a Mathematical Theory of Computation”, in: P. Braffort and D. Hirschberg, Computer Programming and Formal Systems, Amsterdam: North-Holland, pp. 33–70. [McCarthy 1963 available online] (Scholar)
Minsky, Marvin, 1961, “Recursive Unsolvability of Post's Problem of ‘Tag’ and other Topics in Theory of Turing Machines”, Annals of Mathematics, 74(3): 437–455. doi:10.2307/2269716 (Scholar)
–––, 1967, Computation: Finite and Infinite Machines, Englewood Cliffs, NJ: Prentice Hall. (Scholar)
Moore, E.F., 1952, “A simplified universal Turing machine”, Proceedings of the Association of Computing Machinery (meetings at Toronto, Ontario), Washington, DC: Sauls Lithograph, 50–55. doi:10.1145/800259.808993 (Scholar)
Mounier-Kuhn, Pierre, 2012, “Logic and Computing in France: A Late Convergence”, in AISB/IACAP World Congress 2012: History and Philosophy of Programming, University of Birmingham, 2-6 July 2012. [Mounier-Kuhn 2012 available online] (Scholar)
Odifreddi, P., 1989, Classical Recursion Theory, Amsterdam: Elsevier. (Scholar)
Petzold, Charles, 2008, The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and Turing Machines, Indianapolis, IN: Wiley. (Scholar)
Post, Emil L., 1936, “Finite Combinatory Processes-Formulation 1”, Journal of Symbolic Logic, 1(3): 103–105. doi:10.2307/2269031 (Scholar)
–––, 1944, “Recursively Enumerable Sets of Positive Integers and Their Decision Problems”, Bulletin of the American Mathematical Society, 50(5): 284–316. [Post 1944 available online] (Scholar)
–––, 1947, “Recursive Unsolvability of a Problem of Thue”, Journal of Symbolic Logic, 12(1): 1–11. doi:10.2307/2267170 (Scholar)
–––, 1965, “Absolutely Unsolvable Problems and Relatively Undecidable Propositions—Account of an Anticipation”, in Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, New York: Raven Press. Corrected republication 2004, Dover publications, New York, pp. 340–433. (Scholar)
Pullum, Geoffrey K., 2011, “On the Mathematical Foundations of Syntactic Structures”, Journal of Logic, Language and Information, 20(3): 277–296. doi:10.1007/s10849-011-9139-8 (Scholar)
Rabin, M.O. and D. Scott, 1959, “Finite Automata and their Decision Problems”, IBM Journal of Research and Development, 3(2): 114–125. doi:10.1147/rd.32.0114 (Scholar)
Radó, Tibor, 1962, “On Non-Computable Functions”, Bell System Technical Journal, 41(3/May): 877–884. doi:10.1002/j.1538-7305.1962.tb00480.x (Scholar)
Shannon, Claude E., 1956, “A Universal Turing Machine with Two Internal States”, in Shannon & McCarthy 1956: 157–165. doi:10.1515/9781400882618-007 (Scholar)
Shannon, Claude E. and John McCarthy (eds), 1956, Automata Studies, (Annals of Mathematics Studies, 34), Princeton: Princeton University Press. (Scholar)
Shapiro, Stewart, 2007, “Computability, Proof, and Open-Texture”, in Adam Olszewski, Jan Wolenski, and Robert Janusz (eds.), Church’s Thesis After 70 years, Berlin: Ontos Verlag, pp. 420–455. doi:10.1515/9783110325461.420 (Scholar)
Sieg, Wilfried, 1994, “Mechanical Procedures and Mathematical Experience”, in Alexander George (ed.), Mathematics and Mind, Oxford: Oxford University Press, pp. 71–117. (Scholar)
–––, 1997, “Step by Recursive Step: Church’s Analysis of Effective Calculability”, The Bulletin of Symbolic Logic, 3(2): 154–180. doi:10.2307/421012 (Scholar)
–––, 2008, “Church without Dogma: Axioms for Computability”, in S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi (eds.), New Computational Paradigms: Changing Conceptions of What is Computable, New York: Springer Verlag, pp. 139–152. doi:10.1007/978-0-387-68546-5_7 (Scholar)
Sipser, Michael, 1996, Introduction to the Theory of Computation, Boston: PWS Publishing. (Scholar)
Soare, Robert I., 1996, “Computability and Recursion”, Bulletin for Symbolic Logic, 2(3): 284–321. doi:10.2307/420992 (Scholar)
Strachey, Christopher, 1965, “An Impossible Program (letter to the editor )”, The Computer Journal, 7(4): 313. doi:10.1093/comjnl/7.4.313 (Scholar)
Teuscher, Christof (ed.), 2004, Alan Turing: Life and Legacy of a Great Thinker, Berlin: Springer. doi:10.1007/978-3-662-05642-4 (Scholar)
Turing, A.M., 1936–7, “On Computable Numbers, With an Application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society, s2-42: 230–265; correction ibid., s2-43: 544–546 (1937). doi:10.1112/plms/s2-42.1.230 and doi:10.1112/plms/s2-43.6.544 (Scholar)
–––, 1937, “Computability and λ-Definability”, Journal of Symbolic Logic, 2(4): 153–163. doi:10.2307/2268280 (Scholar)
–––, 1939, “Systems of Logic Based on Ordinals”, Proceedings of the London Mathematical Society, s2-45: 161–228. doi:10.1112/plms/s2-45.1.161 (Scholar)
–––, 1947 [1986], “Lecture to the London Mathematical Society on 20 February 1947”, reprinted in A M. Turing's ACE Report of 1946 and Other Papers: Papers by Alan Turing and Michael Woodger, (Charles Babbage Institute Reprint, 10), B.E. Carpenter and R.W. Doran (eds.), Cambridge, MA: MIT Press, 1986. (Scholar)
–––, 1954, “Solvable and Unsolvable Problems”, Science News, (February, Penguin), 31: 7–23. (Scholar)
Wang, Hao, 1957, “A Variant to Turing’s Theory of Computing Machines”, Journal of the ACM, 4(1): 63–92. doi:10.1145/320856.320867 (Scholar)
Watanabe, Shigeru, 1961, “5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines”, Journal of the ACM, 8(4): 476–483. doi:10.1145/321088.321090 (Scholar)
Woods, Damien and Turlough Neary, 2007, “Small Semi-Weakly Universal Turing Machines”, in Jérôme Durand-Lose and Maurice Margenstern (eds.), Machines, Computations, and Universality: 5th International Conference, MCU 2007 Orléans, France, September 10–13, 2007, (Lecture Notes in Computer Science, 4664), Berlin: Springer, pp. 303–315. doi:10.1007/978-3-540-74593-8_26 (Scholar)
–––, 2009, “The Complexity of Small Universal Turing Machines: A Survey”, Theoretical Computer Science, 410(4–5): 443–450. doi:10.1016/j.tcs.2008.09.051 (Scholar)

Generated Mon Sep 25 09:21:44 2023

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...