Normal view MARC view ISBD view

Enumerability Decidability Computability: An Introduction to the Theory of Recursive Functions

Hermes, H

Enumerability Decidability Computability: An Introduction to the Theory of Recursive Functions by H Hermes - - New York Springer-Verlag 1965 - ix,245p. - Die grundlehren der mathematischen wissens chaften 127 .

Subjects--Topical Terms:
Mathematics

Dewey Class. No.: 512.897 / HER

Print
Add to your cart (remove)
Suggest for purchase
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)