University of Zambia Library

Your cart is empty.

University of Zambia Logo University Of Zambia Online Public Access Catalogue

Normal view MARC view ISBD view

Enumerability, decidability, computability; an introduction to the theory of recursive functions by Hans Hermes. Translated by G.T Herman and O. Plassmann.

By: Hermes, Hans.
Material type: materialTypeLabelBookSeries: Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berucksichtigung der Anwendungsgebiete: Bd. 127.Publisher: Berlin, New York, Berlin, New York, Springer-Verlag, 1965Uniform titles: Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit. English Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit. English Subject(s): Recursive functions | Algorithms | Godel's theorem | Computable functionsDDC classification: 164
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographies.

There are no comments for this item.

Log in to your account to post a comment.