Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit: Einfuhrung in die Theorie der Rekursiven Funktiionen, mit 3 Abbildungen.

Berlin, Germany Springer-Verlag, 1961. Hardcover First Edition [1961], unstated. Fine in Very Good DJ: The Book is flawless; the binding is square and secure; the text is clean. Free of any ownership names, dates, addresses, notations, inscriptions, stamps, or labels. The DJ shows indications of careful use: a half-inch closed tear at the top of the rear panel.and a couple of tiny nicks along the top edge; several tiny soil spots here and there; mild rubbing and faint overall soiling; unclipped. A New book in a moderately used DJ. NOT a Remainder, Book-Club, or Ex-Library. 8vo. (9.4 x 6.5 x 0.55 inches). x, 246 pages. Weight: 18.5 ounces. Language: German. First Edition [1961], unstated. Hardback with DJ. Hans Hermes (1912 – 2003) was a German mathematician and logician, who made significant contributions to the foundations of mathematical logic. An English title for this book: "Enumerability – Decidability – Predictability. Introduction to the theory of recursive functions". Hans Hermes was a pioneer of the Turing machine as the central concept of predictability. In 1937, Hermes reported under the title "Definite Terms and Predictable Numbers" an article about the Turing machine, which still adheres closely to Turing ideas, but doesn't contain the concepts of the universal machine and the decision problem. In 1954 Hermes produced an informal proof, that the possibilities of programmable eigenvalues include the predictable functions , so the calculating machines have the same cardinality as Turing machines re: Turing completeness.