Algorithms for Constructing Computably Enumerable Sets

I received an A.B. degree in linguistics from Cornell University in 1978, and a Ph. D. in computer science from the University of Illinois in 1981. Then I worked three years for Hewlett-Packard in Palo Alto, California. Subsequently, I taught for four years at Princeton University, and then 34 years at Ohio State University, where I retired in May, 2022, and now have emeritus status. Along the way, I've consulted for IBM, AT&T, Hewlett-Packard, and various small companies.
My research has primarily been in the analysis of algorithms, however, I've long been fascinated by computability theory, which has been the focus of my research and much of my teaching in recent years. In Autumn, 2021, I taught a graduate level course using an earlier draft of this book as the text.