Normal view MARC view ISBD view

Enumerability, decidability, computability: An introduction to the theory of recursive fucntions.

Hermes, Hans.

Enumerability, decidability, computability: An introduction to the theory of recursive fucntions. by Hans Hermes ; t ranslated by G T Hermann and O Plassman. - 2nd ed. - Berlin. Springer-verlag. 1969 - x,245p.; 24cm.

Dewey Class. No.: 511.8 / HER

Place hold
Print
Add to your cart (remove)
Send to device
Save record
BIBTEX Dublin Core ISBD MARC (non-Unicode/MARC-8) MARCXML MODS (XML) RIS MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard)