390 Are the Androids Dreaming Yet? cfm?id=94952. Turing, Alan M. “Can a Machine Think” The World of Mathematics 4 (1956): 2099-2123. ———. “Computability and A-Definability? The Journal of Symbolic Logic 2, no. 4 (1937): 153-63. ———. “Computing Machinery and Intelligence?” Mind, 1950, 433-60. ———. “Computing Machinery and Intelligence.’ In Computers & Thought, 11-35. MIT Press, 1995. http://dl.acm.org/citation.cfm?id=216410. ———. “Intelligent Machines.” Ince, DC (Ed.) 5 (1992). http://isites.harvard.edu/fs/ docs/icb.topic958294.files/lecture-00-handout.pdf. ———. “Rounding-off Errors in Matrix Processes.” The Quarterly Journal of Mechanics and Applied Mathematics 1, no. 1 (1948): 287-308. Turing, Alan Mathison. “On Computable Numbers, with an Application to the Entscheidungsproblem.” J. of Math 58 (1936): 345-63. ———. “Systems of Logic Based on Ordinals.” Proceedings of the London Mathematical Society 2, no. 1 (1939): 161-228. ———. “The Chemical Basis of Morphogenesis.” Bulletin of Mathematical Biology 52, no. 1 (1990): 153-97. Chapter 11 Baxa, Christoph. “A Note on Diophantine Representations.” American Mathematical Monthly, 1993, 138-43. Blass, Andreas, and Yuri Gurevich. “Algorithms: A Quest for Absolute Definitions? Bulletin of the EATCS 81 (2003): 195-225. Bérger, Egon, Erich Gradel, and Yuri Gurevich. The Classical Decision Problem. Springer, 2001. Carroll, Lewis. Symbolic Logic. New issue of 1896 ed. Dover Publications Inc., 2000. Davis, Martin, Hilary Putnam, and Julia Robinson. “The Decision Problem for Exponential Diophantine Equations.” Annals of Mathematics, 1961, 425-36. Dyson, Verena H., James P. Jones, and John C. Shepherdson. “Some Diophantine Forms of Gédel’s Theorem.” Archive for Mathematical Logic 22, no. 1 (1980): 51-60. Franzén, Torkel. Godel’ Theorem: An Incomplete Guide to Its Use and Abuse. AK Peters/CRC Press, 2005. Hodges, Wilfrid. Logic. 2nd Revised edition. Penguin, 2001. Jr, Frederick P. Brooks. The Mythical Man Month an