Skip to main content

Enumerability · Decidability Computability

An Introduction to the Theory of Recursive Functions

  • Book
  • © 1969

Overview

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

  • 2818 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (7 chapters)

Authors and Affiliations

  • Mathematisches Institut, Albert-Ludwigs-Universität, Freiburg i. Br., Germany

    Hans Hermes

Bibliographic Information

  • Book Title: Enumerability · Decidability Computability

  • Book Subtitle: An Introduction to the Theory of Recursive Functions

  • Authors: Hans Hermes

  • Series Title: Grundlehren der mathematischen Wissenschaften

  • DOI: https://doi.org/10.1007/978-3-642-46178-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin · Heidelberg 1969

  • Softcover ISBN: 978-3-642-46180-4Published: 29 February 2012

  • eBook ISBN: 978-3-642-46178-1Published: 06 December 2012

  • Series ISSN: 0072-7830

  • Series E-ISSN: 2196-9701

  • Edition Number: 2

  • Number of Pages: XII, 250

  • Topics: Mathematics, general

Publish with us