Enumerability, decidability, computability. An introduction to the theory of recursive functions. Translated by G. T. Hermann and O. Plassmann.

; Hermes, Hans. Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit. English
2d rev. ed.. Berlin, New York, Springer, 1969.

Location Call Number Status Consortium Loan
American
WRLC Shared Collections Facility
QA248.5 .H41 1969 Off-site
Request
UDC
Van Ness stacks
QA248.5 .H413 1969 Available Request
George Mason
Fenwick stacks
QA248.5.H4 E6 Available Request
Georgetown
Off-Campus Shelving
QA248.5 .H413 1969 Available Request
Other Title Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit. English.
Other Authors Hermes, Hans.
Subjects Algorithms.
Computable functions.
Gödel's theorem.
Recursive functions.
Series Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete Bd. 127
Description x, 245 p. 24 cm.
Notes Translation of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit.
Includes bibliographies and index.
Network Numbers (OCoLC)00047207
(OCoLC)47207
WorldCat Search OCLC WorldCat

Services

Export citation to: RefWorks