Hermes, H., Hermann, G. T., & Plassmann, O. (1969). Enumerability, decidability computability: An introduction to the theory of recursive functions. Springer-Verlag.
Chicago-stil citatHermes, Hans, G. T. Hermann, och O. Plassmann. Enumerability, Decidability Computability: An Introduction to the Theory of Recursive Functions. Springer-Verlag, 1969.
MLA-referensHermes, Hans, et al. Enumerability, Decidability Computability: An Introduction to the Theory of Recursive Functions. Springer-Verlag, 1969.
Varning: dessa hänvisningar är inte alltid fullständigt riktiga.