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

By: Hermes, HansMaterial type: TextTextLanguage: English, German Series: Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete ; Bd. 127Publication details: Berlin : Springer, 1969Edition: 2d rev. edDescription: x, 245 p. : ill. ; 24 cmUniform titles: Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit. English Subject(s): Recursive functions | Algorithms | Gödel's theorem | Computable functionsDDC classification: 510/.01 LOC classification: QA248.5 | .H413 1969
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Collection Call number Copy number Status Date due Barcode
Book Book University of Macedonia Library
Βιβλιοστάσιο Α (Stack Room A)
Main Collection QA248.5.H413 1969 (Browse shelf (Opens below)) 1 Available 0013066627

Translation of Aufz"ahlbarkeit, Entscheidbarkeit, Berechenbarkeit.

Includes bibliographies.

There are no comments on this title.

to post a comment.
European Union Digital Greece ESPA Default