I graduated from Reed College
I was at the University of Massachusetts at Boston starting in 1984, first in the Department of Mathematics and Computer Science, then in the Department of Computer Science, except for one sabbatical year and two half sabbatical years spent at Heidelberg University. I became a full professor in 1995 and was Department Chair from 2001 to 2019. I retired in May 2019.
My research interests are Computability Theory (also known as Recursion Theory) and Theoretical Computer Science. (See the Computability Theory Wiki 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 taught courses in Theoretical Computer Science.
peter.fejer “at” umb.edu