Michael Stob


Michael Stob

Education

  • BA in mathematics, Calvin College, 1974
  • MS in mathematics, University of Chicago, 1975
  • PhD in mathematics, University of Chicago, 1979

Biography

  • Dean for Academic Administration, Calvin College, 2009–present
  • Assistant, Associate, and Full Professor of Mathematics, Calvin College, 1979–present
  • Visiting Professor of Mathematics, University of Notre Dame, 1997–98, 2005–2006
  • Dean for the Contextual Disciplines and for Natural Sciences and Mathematics, Calvin College, 1998–2004
  • Visiting Associate Professor of Mathematics, University of Wisconsin, 1983–84
  • CLE Moore Instructor in Mathematics, Massachusetts Institute of Technology, 1979–81

Academic interests

computability theory (formerly called recursion theory), cognitive science (especially formal models of learning), tournaments (especially ranking problems)

Publications

“A Supplement to ‘A Mathematician’s Guide to Popular Sports.’” American Mathematical Monthly 91 (1984): 277–82. MR 85i:05122b

Systems That Learn (with D. Osherson and S. Weinstein). Cambridge, MA: MIT Press, 1986.

“Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets” (with P. Cholak and R. Downey). Transactions of the American Mathematical Society 332 (1992): 555–70. MR 92j:03039

“Splitting Theorems in Recursion Theory” (with R. Downey). Annals of Pure and Applied Logic 65 (1993): 1–106. MR 95c:03099

“Extrapolating Human Probability Judgment” (with D. Osherson, E. Smith, T. Myers, and E. Shafir). Theory and Decision 36 (1994): 103–29.

“Computable Boolean Algebras” (with J. Knight). Journal of Symbolic Logic 65 (2000): 1605–23.

×

  • Course code:
  • Credits:
  • Semester:
  • Department:
Top