I graduated from Reed College
Since 1984, I have been at the University of Massachusetts at Boston first in the Department of Mathematics and Computer Science, now in the Department of Computer Science, except for one sabbatical year and another sabbatical half year spent at Heidelberg University. I have been a full professor since 1995 and am currently Department Chair.
My research interests are Computability Theory (also known as Recursion Theory) and Theoretical Computer Science. (See the Computability Theory Web Page for more information on Computability Theory.)
I have co-authored a book, Mathematical Foundations of Computer Science, Volume 1: Sets, Relations and Induction, published by Springer-Verlag in their Texts and Monographs in Computer Science series. Volume 2, Logical Foundations of Computer Science, is in preparation.
My articles (see publications list for the exact references) have mostly dealt with the study of the computably enumerable (also known as recursively enumerable) sets and their degrees under various reducibilities.
I mainly teach courses in Theoretical Computer Science. My teaching schedule for Fall 2012 is:
CS 420 Introduction to the Theory of Computation MW 16:00 - 17:15 M-3-204
My office hours are:
M 15:00-16:00, 17:30-18:00
W 15:00-16:00, 17:30-18:00