Algorithms for Constructing Computably Enumerable Sets

“This is a concise book on the subject of computably enumerable (c.e.) sets and their constructions. … This book differs from all other textbooks in computability theory in its exercises. Instead of math-oriented problem sets, the exercises here are mostly discussions of technical details of the proofs … . This type of trial-and-error process is an essential step in learning computability as a beginner, and it is interesting to see how to explicitly emphasize it in the form of exercises.” (Mingzhong Cai, Mathematical Reviews, August, 2024)

“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)