CS 452 - Automata and Formal Languages - Spring 2004

• Church, Alonzo, An unsolvable problem of elementary number theory. Am. J. Math. 58 (1938) 345--363. AND Church, Alonzo, A note on the Entscheidungsproblem. J. Symb. Log. 1 (1936) 40--41. (To be presented by David Weissman + Tracy Grauman)
• Turing, Alan, On computable numbers, with an application to the Entscheidungsproblem. P. London Math. Soc. (2) 42 (1936--7) 230--265. (Hedberg + Kao + Renaud)
• Post, Emil, Finite combinatorial processes-- Formulation I. J. Symb. Log. 1(1936) 103--105. (Berkovitch + Fishbein)
• Post, Emil [1941], "Absolutely unsolvable problems and relatively undecidable propositions", reprinted in Davis [1965].
  Davis, Martin, ed. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Hewlett, NY, Raven Press (1965). (VanDerWerf + Blake)
• Kalmar, Laszlo, An argument against the plausibility of Church's Thesis. in A. Heyting, ed., Constructivity in Mathematics, pp. 72--80. (Puwani + Abdel)
• Cleland, Carol [1993], "Is the Church-Turing thesis true?", Minds and Machines 3, 283--312. (Ghanekar + Manprit)
• Mendelson, Elliott [1990], "Second thoughts about s thesis and mathematical proofs", The Journal of Philosophy 87, 225--233. (Jaslar + Epstein + Fickas)
• Stewart Shapiro, "Understanding Church's Thesis". Journal of Philosophical Logic 10 (1981), pp. 353--365. (Koppelman + Shoykhet)
• Janet Folina, "Church's Thesis: Prelude to a Proof". Philosophia Mathematica (3) Vol. 6 (1998), pp. 302--323.
• Valerie Hardcastle, "Computationalism". Synthese 105 (1996), pp. 303--317.
• Wilfrid Sieg, "Mechanical procedures and mathematical experience". in Alex George, ed. _Mathematics and Mind_. Oxford: Oxford U. Press, pp. 71--117.
• Stewart Shapiro, "Understanding CHurch's Thesis, again". Acta Analytica 11, 1993, pp. 59--77. (if you want this one, ask me for a copy since it's an impossible-to-find Croatian journal)