Hermes, H. (1969). Enumerability, decidability, computability: An introduction to the theory of recursive functions. Springer-Verlag.
Chicago-čujuhus (17. p.)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Berlín: Springer-Verlag, 1969.
MLA-čujuhus (9. p.)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Springer-Verlag, 1969.
Muitte dárkkistit čujuhemiid riektatvuođa, ovdal go geavahat daid iežat deavsttas.