Hermes, H. (1969). Enumerability, decidability, computability: An introduction to the theory of recursive functions. Springer-Verlag.
Cita Chicago (17th ed.)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Berlín: Springer-Verlag, 1969.
Cita MLA (9th ed.)Hermes, Hans. Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions. Springer-Verlag, 1969.
Atenció: Aquestes cites poden no estar 100% correctes.