WILLIAM C. CALHOUN
Department of Mathematics and Computer Science 725 East Third Street Bloomsburg University of Pennsylvania Bloomsburg, PA 17815 Bloomsburg, Pennsylvania 17815 (570) 389-7598 Telephone: (570) 389-4507 FAX: (570) 389-3599 Email: wcalhoun@bloomu.edu
EDUCATION
University of California, Berkeley Ph.D., Mathematics, 1990 Dissertation: The Lattice of Ideals of Recursively Enumerable Degrees Committee: Leo Harrington (chair), Jack Silver, Manuel Blum
Carleton College B.A., Mathematics with concentration in Computer Science, 1982 Magna cum laude, honors in mathematics, honors in independent study, Phi Beta Kappa, Sigma Xi
EMPLOYMENT
Bloomsburg University of Pennsylvania Associate Professor 2002-present Dept. of Mathematics, C.S. and Stat.
Bloomsburg University of Pennsylvania Assistant Professor 1997-2002 Dept. of Mathematics, C.S. and Stat.
Kalamazoo College Assistant Professor 1990 -1997 Department of Mathematics and C.S.
University of California, Berkeley Instructor/Research Assistant 1989-1990 Department of Mathematics
University of Chicago Research Assistant 1987-1988 Department of Mathematics
University of California, Berkeley Graduate Student Instructor 1983-1987 Department of Mathematics and 1988-89 PUBLICATIONS Degrees of monotone complexity, submitted (October 2005). Minimal distinct distance trees, with K. Ferland, L. Lister and J. Polhill, The Journal of Combinatorial Mathematics and Combinatorial Computing, to appear (accepted). From Hilbert's program to computer programming, a chapter of the book From Calculus to Computers (A. Shell-Gellash and D. Jardine editors), Mathematical Association of America (November 2005). Totally magic labelings of graphs, with K. Ferland, L. Lister and J. Polhill, Australasian Journal of Combinatorics, Vol. 32 (June 2005), pp. 47-60. Volleyball scoring systems, with G. R. Dargahi-Noubary and Yixun Shi, Mathematics and Computer Education, Vol. 36, No. 1 (Winter 2002) pp. 70-79. Embedding finite lattices into the ideals of computably enumerable Turing degrees, with Manuel Lerman, The Journal of Symbolic Logic, 66, No. 4 (Dec. 2001), 1891-1802 Changing the rules of tennis: An exercise in mathematical modeling, with Reza Noubary, Carver, 15, No. 1 (Spring 1998), Bloomsburg University, 15-23 Least squares and projections, with Mikhail Bouniaev, David Hill, Leigh Ann Myers, and Fred Worth, Academic Forum, No. 14 (1997), Henderson State University, 94-104 The enumeration degrees are not dense, with Theodore A. Slaman, Journal of Symbolic Logic, 61, No. 4 (Dec. 1996), 1364-1379 Incomparable prime ideals of recursively enumerable degrees, Annals of Pure and Applied Logic, 63 (1993), 39 - 56 The lattice of ideals of r.e. degrees, (research announcement), The Recursive Function Theory Newsletter, 38 (July, 1989), 377 Counting the subgroups of some finite groups, American Mathematical Monthly, 94, No. 1 (January, 1987), 54-59 CONFERENCE PRESENTATIONS Degrees of monotone complexity, American Mathematical Society, San Antonio, January 15, 2006. Weaving history into math and science courses, CETP-PA K-12 Professional Development Day, Bloomsburg University, October 14, 2005. Monotonicity of complexity measures, Association for Symbolic Logic, Stanford University, March 22, 2005. Totally magic labelings of graphs, American Mathematical Society, Phoenix, January 10, 2004. From Hilbert's program to computer programming, Mathematical Association of America (MathFest), University of Vermont, August 2, 2002. Integrating security concepts into computer theory classes, Association for Computer Machinery 33rd Technical Symposium on Computer Science Education, Cincinnati, February 28, 2002. A tree-labelling problem of Leech, American Mathematical Society, San Diego, January 8, 2002 Embedding finite lattices into the ideals of computably enumerable Turing degrees, Association for Symbolic Logic, Logic Colloquium 2000, Paris, France, July 2000 Records in a changing population: an elementary approach, American Mathematical Society, Washington, D.C., January 22, 2000 Embedding lattices into the lattice of ideals of computably enumerable Turing degrees, Association for Symbolic Logic, San Antonio, January 15, 1999 Growth rate degrees, Association for Symbolic Logic, San Diego, January 11, 1997 “Tech” lesson plans: least squares problems, American Mathematical Society, San Diego, January 8, 1997 The e-degrees are not dense, 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, Italy, 1995 Structured programming for priority arguments, Association for Symbolic Logic, Irvine, 1995 An untangled proof of the recursion theorem, Association for Symbolic Logic, San Francisco, 1995 The e-degrees are not dense, Association for Symbolic Logic, South Bend, 1993 Incomparable prime ideals of recursively enumerable degrees, 9th International Congress of Logic, Methodology and Philosophy of Science, Uppsala, Sweden, 1991 The lattice of ideals of r.e. degrees, American Mathematical Society, Special Session in Recursion Theory, Chicago, 1989 Counting the subgroups of some finite groups, Mathematical Association of America, North Central Section, Collegeville, Minnesota, 1982
BLOOMSBURG UNIVERSITY GRANTS Faculty Professional Development Travel Allocation, for travel to a meeting of the American Mathematical Society in San Antonio, January 12-15, 2006. Research/Scholarship Award, with John Polhill, for honoraria and expenses for two speakers (Dr. James Davis, University of Richmond; Dr. Alexander Richman, Bucknell University) for the 2004-2005 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Faculty Professional Development Travel Allocation, for travel to a meeting of the American Mathematical Society in Phoenix, January 7-10, 2004. Special Initiatives Allocation, with John Polhill, for honoraria and expenses for three speakers (Zhe-Xian Wan, Chinese Academy of Mathematics; Bob Bogart, National Security Agency; Lynn Doty, Marist College) for the 2003-2004 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Special Initiatives Allocation, with John Polhill, for honoraria and expenses for three speakers (Dr. Lynn Breyfogle, Bucknell University; Dr. Ramin Arani, Jannsen Research Foundation; Dr. Michael Fry, Lebanon Valley College) for the 2002-2003 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Bloomsburg University Foundation, for travel to a meeting of the Association for Computing Machinery in Cincinnati, February 28, 2002. Faculty Professional Development Travel Allocation, for travel to a meeting of the Mathematical Association of America (MathFest) in Burlington, Vermont, July 31-August 3, 2002. Bloomsburg University Foundation, for travel to a meeting of the American Mathematical Society in San Diego, January 5-9, 2002. Faculty Professional Development Travel Allocation, for travel to a meeting of the American Mathematical Society in San Diego, California, January 6-9, 2002. Special Initiatives Allocation, with John Polhill, for honoraria and expenses for two speakers (Dr. Joseph Evan, King's College and Dr. Derek Smith, Lafayette College) for the 2001-2002 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Special Initiatives Allocation, with John Polhill, for honoraria and expenses for three speakers (Dr. Vernon Chinchilli, Pennsylvania State University, Dr. David Hatch, National Security Agency and Dr. Zuhair Nashed, University of Delaware) for the 2000-2001 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Faculty Professional Development Travel Allocation, for travel to a meeting of the Association for Symbolic Logic, Logic Colloquium 2000 in Paris, France July 23-31, 2000. Special Initiatives Allocation, with Yixun Shi, for honoraria and expenses for two speakers (Dr. Jerry King, Lehigh University and Dr. Doris Schattshneider, Moravian College) for the 1999-2000 Bloomsburg University Mathematics, Computer Science and Statistics Department Seminar Series. Faculty Professional Development Travel Allocation, for travel to a meeting of the American Mathematical Society in Washington, D. C., January 20-22, 2000. Bloomsburg University Foundation, for travel to the American Mathematical Society-Institute of Mathematical Sciences-Society for Industrial and Applied Mathematics Joint Summer Research Conference on Computability and Applications, Boulder, Colorado, June 13-17, 1999. Faculty Professional Development Travel Allocation, for travel to a meeting of the American Mathematical Society in San Antonio, Texas, January 12-18, 1999. Bloomsburg University Foundation, for travel to a meeting of the American Mathematical Society at the University of Wisconsin-Milwaukee, October 24-25 1998.
EXTERNAL AWARDS Association for Symbolic Logic, Travel grant to present a paper at the 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, Italy, 1995 Pew Midstates Science and Mathematics Consortium, Faculty Development Award, to support research with Dr. Theodore Slaman, University of Chicago, 1992 Association for Symbolic Logic, Travel grant, to present a paper at the 9th International Congress of Logic, Methodology and Philosophy of Science, Uppsala, Sweden 1991
SEMINAR AND COLLOQUIUM PRESENTATIONS
Degrees of monotone complexity, Cornell University Logic Seminar, February 28, 2006. Degrees of Randomness, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar Series, November 8, 2005. Minimal Distinct Distance Trees, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar, October 26, 2004. Weaving History into Science Courses, Bloomsburg University Teaching and Learning Center Seminar, March 4, 2004. Games Mathematicians Play: Ramsey Theory, Determinacy and Tic-Tac-Toe, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar, November 11, 2003. Who Invented the Computer?, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar, November 5, 2002. Density questions in the enumeration degrees I, University of California at Berkeley, February 3, 2005. Density questions in the enumeration degrees II, University of California at Berkeley, February 10, 2005. Computably enumerable Turing degrees: an algebraic approach, Pennsylvania State University Logic Seminar, November 13, 2001 Consecutive distance trees, with John Polhill, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar Series, November 27, 2001 Forest: a Java program to search for consecutive distance trees, Bloomsburg University Combinatorics Seminar, March 22, 2001 Mathematica for calculus, modeling and programming, (lecture demonstration for teachers) Bloomsburg University High School Mathematics Contest, November 14, 2000 Frankl's Conjecture, Bloomsburg University Combinatorics Seminar, September 21, 2000 Why bother with noncomputable numbers?, Bloomsburg University Department of Mathematics, Computer Science and Statistics Seminar Series, April 11, 2000 Population growth and sports records, Shippensburg University, November 18, 1999 and Bloomsburg University Department of Mathematics and Computer Science Seminar Series, November 10, 1998 The lattice embedding problem for the ideals of computably enumerable Turing degrees, University of Connecticut, October 15, 1999 The Enumeration degrees are not dense, Cornell University and University of Connecticut, 1998 Kleene’s Recursion Theorem, Washington Area Recursion Theory Seminar, University of Maryland, May 1998 and Bloomsburg University Department of Mathematics and Computer Science Seminar Series, 1997 Structured programming for priority arguments, University of Wisconsin, 1995 The e-degrees are not dense, University of Michigan and University of Chicago, 1993 What's your oracle? An introduction to Turing degrees, Western Michigan University, 1992 Frameworks for priority arguments, University of Notre Dame, University of Michigan and University of Wisconsin, 1991-1992 The Turing degrees, Western Michigan University, 1991 When a CRAY won't help, Calvin College, Western Michigan University and Wabash College, 1991 Algebraic structure in the recursively enumerable degrees, Florida International University, 1990 An ideal of r.e. degrees with no maximal subideal, Mathematical Sciences Research Institute, 1990 Embedding lattices in the ideals of recursively enumerable degrees, Mathematical Sciences Research Institute, 1990 A splitting theorem for ideals of recursively enumerable degrees, Mathematical Sciences Research Institute, 1989
COURSES TAUGHT Bloomsburg University Mathematics Courses Mathematical Thinking, Finite Mathematics, Applied Matrix Algebra, Theory of Arithmetic, PreCalculus, Essentials of Calculus, Calculus I, II, III and IV, Discrete Mathematics, Linear Algebra, Number Theory, Abstract Algebra Computer Science Courses Organization of Programming Languages, Special Topics (Theory of Computation)
Kalamazoo College Calculus I, II and III, Linear Algebra, Discrete Mathematics, Computability, Finite Automata and Formal Languages, Model Theory and Nonstandard Analysis, Real Analysis II, Complex Variables, Problem Solving Workshop University of California, Berkeley Precalculus, Calculus, Sophomore Mathematics (Linear Algebra, Differential Equations, Vector Calculus), Discrete Mathematics, Real Analysis
INDEPENDENT STUDIES/PROJECTS SUPERVISED Bloomsburg University Internet Security Awareness, Applications of Computational Complexity to Information Security, Analysis of Adoption Statistics
Kalamazoo College Discrete Mathematics, Automorphisms of the Random Graph, Degrees (Asymptotic equivalence), Modern Algebra (Ring Theory), Nonstandard Analysis, Ramsey Theory
PARTICIPATION IN MATHEMATICS AND COMPUTER SCIENCE WORKSHOPS Program Analysis, Dr. Ras Bodik, Department of Computer Science, University of California at Berkeley, Spring semester 2005. Reading the Book of Life, a workshop on bioinformatics at a meeting of the Mathematical Association of America (MathFest) in Boulder, Colorado, July 26- August 3, 2003. Cybersecurity Workshop, National Science Foundation, Indiana University of Pennsylvania, August 5-10, 2001 Java Programming, Hands on Technology Transfer, Inc., Bloomsburg University (supported by the department's Link-to-Learn grant), May 21-24, 2001 Object Oriented Analysis and Design, Hands on Technology Transfer, Inc., Bloomsburg University (supported by the department's Link-to-Learn grant), March 12-15, 2001 Mastering MFC Fundamentals using Microsoft Visual C++, Productivity Point, Bloomsburg University (supported by the department's Link-to-Learn grant), January 8-11, 2001 ATLAST Developers Workshop (Use of MATLAB in teaching Linear Algebra), University of Washington, 1996 Connections in Science, Pew Foundation, University of Chicago, 1995 ATLAST Workshop (Use of MATLAB in teaching Linear Algebra), Seattle University, 1995 Computer-based Reform in Science and Mathematics, Pew Foundation, Knox College, 1994 Cooperative Learning in the Sciences, Pew Foundation, Carleton College, 1992 The New Mathematics Professor, Pew Foundation, St. Olaf College, 1990
SERVICE AT BLOOMSBURG UNIVERSITY Bloomsburg University General Administration Committee, September 2005-present APSCUF Treasurer, July 2005-present APSCUF Nominations, Rules and Elections Committee, May 2003-present Mathematics, Comp. Sci. and Stats. Seminar Committee, (chair 98-03, Fall 04, Fall 05) 1997-December 2004, September 2005-present Mathematics, Comp. Sci. and Stats. Career Day Committee, (chair 00-02) 1998-2002, September 2005-present Neil Postman's Amusing Ourselves to Death, Discussion Leader, Fall 2004 and 2005 Mathematics Curriculum Committee, (chair 99-00, 02-03) 1999-present High School Mathematics Contest Committee, 1998-2000, and 2002-present High School Programming Contest Committee, 1999-present New Student Move-In Day Volunteer, Fall 1998, 1999, 2001, 2003, 2004 The Example of Fredrick Douglas Discussion Leader, Fall 2001-3 Mathematics, Comp. Sci. and Stats. Personnel Committee, (chair) 2003-4 Mathematics, Comp. Sci. and Stats. Graduate Program Ad Hoc Committee, 2003-4 Mathematics, Comp. Sci. and Stats. 5^{th} Year Program Review Committee (co-chair) 2000-1 Statistics Curriculum Committee, (chair) 1999-2000 Challenge of Socrates Discussion Leader, Fall 1998 and 1999 Mathematics and Computer Science Search and Screen Committee, 1998-9 Statistics Track Committee, (chair) 1997-9 Mathematics/Statistics Curriculum Committee (chair, 97-98) 1997-9 PROFESSIONAL SERVICE AND MEMBERSHIPS Referee for The Journal of Symbolic Logic, Archive for Mathematical Logic, The Journal of Mathematical Logic, The American Mathematical Monthly and Transactions of the American Mathematical Society. Reviewer for Gordon and Breach Science Publishers and Morgan Kaufman/Elsevier. External scholarship evaluator for the University of Pittsburgh at Johnstown. Member of the American Mathematical Society since 1990. Member of the Mathematical Association of America since 1981. Member of the Association for Symbolic Logic since 1990. |