Enumerability, decidability, computability;: An introduction to the theory of recursive functions/
Hermes, Hans
Enumerability, decidability, computability;: An introduction to the theory of recursive functions/ Translated by G. T. Hermann and O. Plassmann. - 2d rev. ed. - Berlin: New York: Springer, 1969. - x, 245 p.: 24 cm. - Grundlehren der mathematischen Wissenschaften; Bd. 127. .
Translation of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit.
Includes bibliographies.
76089552 //r852
GDB***
Recursive functions
Algorithms.
Godel's theorem.
Computable functions.
Funções (Matemática)
Computabilidade e Modelos de Computação.
Logica Matematica.
511.3 / H553e
Enumerability, decidability, computability;: An introduction to the theory of recursive functions/ Translated by G. T. Hermann and O. Plassmann. - 2d rev. ed. - Berlin: New York: Springer, 1969. - x, 245 p.: 24 cm. - Grundlehren der mathematischen Wissenschaften; Bd. 127. .
Translation of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit.
Includes bibliographies.
76089552 //r852
GDB***
Recursive functions
Algorithms.
Godel's theorem.
Computable functions.
Funções (Matemática)
Computabilidade e Modelos de Computação.
Logica Matematica.
511.3 / H553e