Hermes, H. Enumerability. Decidability. Computability. An introduction to the theory of recursive functions. (English) Zbl 0179.01801 Berlin-Heidelberg-New York: Springer-Verlag 1969. XII, 245 p. (1969). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents Keywords:recursion theory, constructive mathematics PDF BibTeX XML OpenURL