Hermes, H. (1969). Enumerability, decidability, computability: An introduction to the theory of recursive functions. Springer-Verlag.
Citazione stile Chigago Style (17a edizione)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Berlín: Springer-Verlag, 1969.
Citatione MLA (9a ed.)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Springer-Verlag, 1969.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.