Cooper, S. B., Slaman, T., & Wainer, S. (1996). Computability, enumerability, unsolvability: Directions in recursion theory. London Mathematical Society lecture note series. https://doi.org/10.1017/CBO9780511629167
Chicago Style (17th ed.) CitationCooper, Stuart B., T. Slaman, and S. Wainer. "Computability, Enumerability, Unsolvability: Directions in Recursion Theory." London Mathematical Society Lecture Note Series 1996. https://doi.org/10.1017/CBO9780511629167.
MLA (9th ed.) CitationCooper, Stuart B., et al. "Computability, Enumerability, Unsolvability: Directions in Recursion Theory." London Mathematical Society Lecture Note Series, 1996, https://doi.org/10.1017/CBO9780511629167.
Warning: These citations may not always be 100% accurate.