Enumerability · Decidability Computability
- Authorized Dealer
- Ships within 1 business day
- Free 30-Day Returns
- Secure Checkout via Shopify Payments
Details
"Enumerability · Decidability Computability" by Hans Hermes is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.
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.
Materials + Care
We prioritize quality in selecting the materials for our items, choosing premium fabrics and finishings that ensure durability, comfort, and timeless appeal.
Shipping + Returns
We strive to process and ship all orders in a timely manner, working diligently to ensure that your items are on their way to you as soon as possible.
"Enumerability · Decidability Computability" by Hans Hermes is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.
Topic: Core Mathematics
Author: Hans Hermes
Who this is for:
- Teachers and classroom instructors
- Students building subject mastery
- Readers looking for practical learning support
Why this book matters: It stands out as a practical math resource that helps explain concepts, strengthen problem-solving, and support classroom or independent learning.
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.
| Author | Hans Hermes |
| Publisher | Springer |
| Published | 2012-02-29 |
| ISBN-13 | 9783642461804 |
| Binding | Paperback |
| Language | English |
| Subjects | Mathematics |
| Topic | Core Mathematics |
| Series | Grundlehren Der Mathematischen Wissenschaften |
Format: Paperback
Language: English
Shop by collection
Books
