Algorithms for Constructing Computably Enumerable Sets

Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.

Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.

Topics and features:

· All other books in this field focus on the mathematical results, rather than on the algorithms.

· There are many exercises here, most of which relate to details of the algorithms.

· The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature.

· The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms.

· In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.

Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.

Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.

Focuses on algorithmic techniques Presents algorithms in pseudo-code that is familiar to CS students Broadens the appeal and influence of some little-known algorithms

Auteur
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.

Résumé
"The book is organized as a mathematics or theoretical computer science (CS) textbook. Theorems and lemmas, as well as pseudocode, demonstrate the solutions, and each chapter concludes with exercises. A very useful chapter summary describes the resultspresented in the chapter through a semiformal explanation." (Bálint Molnár, Computing Reviews, November 15, 2023)

Contenu
1 Index of notation and terms.- 2 Set theory, requirements, witnesses.- 3 What's new in this chapter?.- 4 Priorities (a splitting theorem).- 5 Reductions, comparability (Kleene-Post Theorem).- 6 Finite injury (Friedberg-Muchnik Theorem).- 7 The Permanence Lemma.- 8 Permitting (Friedberg-Muchnik below C Theorem).- 9 Length of agreement (Sacks Splitting Theorem).- 10 Introduction to infinite injury.- 11 A tree of guesses (Weak Thickness Lemma).- 12 An infinitely branching tree (Thickness Lemma).- 13 True stages (another proof of the Thickness Lemma).- 14 Joint custody (Minimal Pair Theorem).- 15 Witness lists (Density Theorem).- 16 The theme of this book: delaying tactics.- Appendix A: a pairing function.- Bibliograph.- Solutions to selected exercises.