Bibliography 391 Reid, Constance. Julia: A Life in Mathematics. Washington, DC: The Mathematical Association of America, 1997. Rice, Henry Gordon. “Classes of Recursively Enumerable Sets and Their Decision Problems.” Transactions of the American Mathematical Society 74, no. 2 (1953): 358-66. Ruohonen, Keijo. “Hilbertin Kymmenes Probleema.’ Arkhimedes, no. 1 (1972): 2. Spolsky, J. “The Law of Leaky Abstractions? November 11, 2002. http://www. joelonsoftware.com. Tegmark, Max. “The Mathematical Universe.’ Foundations of Physics 38, no. 2 (2008): 101-50. Turing, Alan M. “Can a Machine Think” The World of Mathematics 4 (1956): 2099-2123. 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. Wiles, Andrew. “Modular Elliptic Curves and Fermat’s Last Theorem.” Annals of Mathematics-Second Series 141, no. 3 (1995): 443-552. Chapter 12 Burgin, Mark. Super-Recursive Algorithms. Springer, 2005. Darwin, Charles. On the Origin of Species: By Means of Natural Selection. Dover Giant Thrift Ed. Dover Publications Inc., 2006. Mitchell, Melanie. An Introduction to Genetic Algorithms. New edition. MIT Press, 1998. Siegelmann, Hava T. Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhauser, 1998. Syropoulos, Apostolos. Hypercomputation: Computing Beyond the Church- Turing Barrier. Softcover reprint of hardcover 1st ed. 2008. Springer, 2010. Chapter 13 Shannon, C.E., and Warren Weaver. The Mathematical Theory of Communication. University of Illinois Press, 1949. Chapter 14 Boden, Margaret A. The Creative Mind: Myths and Mechanisms. 2nd ed. Routledge, 2003. Bono, Edward de. How to Have Creative Ideas: 62 Exercises to Develop the Mind. Vermilion, 2007. ———. Lateral Thinking: A Textbook of Creativity. Penguin, 2009. ———. Six Thinking Hats. Penguin, 2009. Coyle,