Hermes, H. (1969). Enumerability, decidability, computability: An introduction to the theory of recursive functions (2d rev. ed.). Springer.
Chicago Style (17th ed.) CitationHermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. 2d rev. ed. Berlin ; New York: Springer, 1969.
MLA (8th ed.) CitationHermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. 2d rev. ed. Springer, 1969.
Warning: These citations may not always be 100% accurate.