Hermes, Hans <br/><br/>
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. .
<br/><br/> Translation of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit. 
<br/><br/>Includes bibliographies. 
<br/><br/><label>LCCN: </label>76089552 //r852 
<br/><br/><label>Nat. Bib. No.: </label>GDB*** 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Recursive functions<br/>Algorithms.<br/>Godel's theorem.<br/>Computable functions.<br/>Funções (Matemática)<br/>Computabilidade e Modelos de Computação.<br/>Logica Matematica.
<br/><br/><label>Dewey Class. No.: </label>511.3  / H553e