Hermes, H. (1965). Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions. Springer Berlin Heidelberg.
Chicago Style (17th ed.) CitationHermes, Hans. Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions. Berlin, Heidelberg: Springer Berlin Heidelberg, 1965.
MLA (9th ed.) CitationHermes, Hans. Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions. Springer Berlin Heidelberg, 1965.
Warning: These citations may not always be 100% accurate.