Enumerability Decidability Computability

Hans Hermes

5 ratings by Goodreads

Language: English

Published by Springer Berlin Heidelberg Feb 2012, 2012

3642461808 / 9783642461804

Series: Book 108 of 184 - Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge/A Series of Modern Surveys in Mathematics

  • Softcover
  • New
See all details

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

5-star seller

AbeBooks seller since January 11, 2012

View this seller's items
Softcover

Condition: New

US$ 63.23

US$ 26.40 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 264 pp. Englisch.

Seller Inventory # 9783642461804

Title
Enumerability Decidability Computability
Author
Hans Hermes
Publisher
Springer Berlin Heidelberg Feb 2012
Publication year
2012
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3642461808
ISBN 13
9783642461804
Edition
2nd Edition
Item weight
406 grams
Dimensions
235x155x15 mm
Series
Book 108 of 184: Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge/A Series of Modern Surveys in Mathematics

BuchWeltWeit Ludwig Meier e.K.

Bergisch Gladbach, Germany

5-star seller

AbeBooks seller since January 11, 2012

Shipping rates from Germany to U.S.A.

Item5 to 15 business days5 to 15 business days
First itemUS$ 26.40US$ 26.40
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Bank Wire Transfer
  • Check
  • Paypal

Seller's business information

BuchWeltWeit Ludwig Meier e.K.

Germany