Throughout July 2018 users will experience some minor, temporary disruptions to library services as we transition to an improved library management and search system. Click here for more information or contact us for questions.

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 Algorithmes.
Algorithms.
Computable functions.
Fonctions calculables.
Fonctions récursives.
Gödel's theorem.
Gödel, Théorème de.
Recursive functions.
Description x, 245 pages 24 cm.
Copyright Date 1969.
Notes Includes bibliographies and index.
Genre Einführung.
Network Numbers (OCoLC)00047207
(OCoLC)47207
WorldCat Search OCLC WorldCat
WorldCat Identities Hermes, Hans.
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks