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

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

Saved in:

Bibliographic Details
Author / Creator:	Hermes, Hans
Uniform title:	Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit. English
Edition:	2d rev. ed.
Imprint:	Berlin; New York, Springer, 1969.
Description:	x, 245 p. 24 cm.
Language:	English German
Series:	Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete. Bd. 127
Subject:	Recursive functions Algorithms Gödel's theorem Computable functions Algorithms. Computable functions. Gödel's theorem. Recursive functions.
Format:	Print Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/874268

Hidden Bibliographic Details
Notes:	Translation of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit. Includes bibliographies.

Eckhart

Loading map link

Holdings details from Eckhart
Call Number:	QA248.5.H555
c.2	Available Loan period: standard loan Request for Pickup Need help? - Ask a Librarian