by Leon Harkleroad
Award: George Pólya
Year of Award: 1997
Publication Information: The College Mathematics Journal, Vol. 27, No. 1, (1996), pp. 37-42
Summary: A discussion of mathematical proofs of non-computability.
Read the Article
About the Author: (from The College Mathematics Journal, Vol. 27, No. 1, (1996))
Leon Harkleroad writes that his alleged specialty is computability (recursion theory). But he can also be found working on the history of mathematics (focusing on the life and works of Rozsa Peter) or, under the pen name Houston Euler, perpetrating mathematical humor. He is currently a visiting associate professor at Cornell University, where he recently developed a course on mathematics and music. Other activities include playing piano, playing first base, and folk dancing.
Subject classification(s): Logic and Foundations | Logic | Computability and Decidability