Enumerability, decidability, computability : an introduction to the theory of recursive functions

Author(s)

• Hermes, Hans

Bibliographic Information

Enumerability, decidability, computability : an introduction to the theory of recursive functions

Hans Hermes ; translated by G.T. Hermann and O. Plassmann

（Die Grundlehren der mathematischen Wissenschaften, Bd. 127）

Springer, 1969

2nd rev. ed

Other Title

Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit

• NCID: BA03957927
• Country Code: gw
• Title Language Code: eng
• Text Language Code: eng
• Original Language Code: ger
• Place of Publication: Berlin ; New York
• Pages/Volumes: x, 245 p.
• Size: 24 cm
• Classification:
  • LCC : QA248.5
  • DC : 510/.01
• Subject Headings:
  • LCSH : Recursive functions
  • LCSH : Algorithms
  • LCSH : Gödel's theorem
  • LCSH : Computable functions
• Parent Bibliography ID:
  • BA00007422