© 1969

Enumerability · Decidability Computability

An Introduction to the Theory of Recursive Functions


Part of the Die Grundlehren der mathematischen Wissenschaften book series (GL, volume 127)

Table of contents

  1. Front Matter
    Pages I-XI
  2. Hans Hermes
    Pages 31-59
  3. Hans Hermes
    Pages 59-93
  4. Hans Hermes
    Pages 113-140
  5. Hans Hermes
    Pages 141-187
  6. Hans Hermes
    Pages 187-240
  7. Back Matter
    Pages 241-249

About this book


Once we have accepted a precise replacement of the concept of algo­ rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo­ rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe­ matics in the first half of the twentieth century. If we grant the legitimacy of the suggested precise replacements of the concept of algorithm and related concepts, then we can say that the mathematicians have shown by strictly mathematical methods that there exist mathematical problems which cannot be dealt with by the methods of calculating mathematics. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the "limitations of the mathematicizing power of Homo Sapiens". Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms.


Functions Mathematica Rekursive Funktion Turing machine algorithms arithmetic calculus computability decidability enumerability function group logic mathematics

Authors and affiliations

  1. 1.Mathematisches InstitutAlbert-Ludwigs-UniversitätFreiburg i. Br.Germany

Bibliographic information

  • Book Title Enumerability · Decidability Computability
  • Book Subtitle An Introduction to the Theory of Recursive Functions
  • Authors Hans Hermes
  • Series Title Die Grundlehren der mathematischen Wissenschaften
  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1969
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Hardcover ISBN 978-3-540-04501-4
  • Softcover ISBN 978-3-642-46180-4
  • eBook ISBN 978-3-642-46178-1
  • Series ISSN 0072-7830
  • Edition Number 2
  • Number of Pages XII, 250
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Mathematics, general
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking