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.

我於1978年在康奈爾大學獲得語言學的學士學位，並於1981年在伊利諾伊大學獲得計算機科學的博士學位。隨後，我在加州帕洛阿爾托的惠普工作了三年。之後，我在普林斯頓大學教學四年，接著在俄亥俄州立大學任教34年，並於2022年5月退休，現在擁有名譽教授的身份。在此期間，我曾為IBM、AT&T、惠普及各種小型公司提供諮詢服務。

我的研究主要集中在算法分析上，然而，我對可計算性理論一直充滿興趣，這也是我近年來研究和教學的重點。在2021年秋季，我教授了一門研究生課程，使用這本書的早期草稿作為教材。