Document

390 Are the Androids Dreaming Yet?

Ref IMAGES-003-HOUSE_OVERSIGHT_016080.txt Release House Oversight Committee — Epstein Estate Records (Nov 2025) 1 pages

Epstein Suite indexes the text; the original document lives at its official source. We don't host the original file — view it on the official release to read it in full.

View the original on the official release

Document text

Text is machine OCR and may contain errors. Confirm against the original source above.

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 and Other Essays on Software Engineering. 2nd ed. Addison Wesley, 1995. Kurzweil, Ray. How to Create a Mind: The Secret of Human Thought Revealed. Penguin, 2012. Matiyasevich, Yuri. HILBERT’S TENTH PROBLEM: What Can We Do with Diophantine Equations?. Accessed April 13, 2014. http://logic.pdmi-ras. ru/~yumat/Journal/H10history/H10histe.pdf.gz. Minsky, Marvin Lee. Computation. Prentice-Hall Englewood Cliffs, 1967. http:// cba.mit.edu/events/03.11.ASE/docs/Minsky.pdf. Nagel, Ernest, and James R. Newman. Godel’s Proof. Rev. Ed. New York University Press, 2001. Penrose, Sir Roger. Shadows Of The Mind: A Search for the Missing Science of Consciousness. New edition. Vintage, 2005. —— —. The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics. New Ed. Oxford Paperbacks, 1999. HOUSE_OVERSIGHT_016080

Have a question about what this document contains?

Ask the documents