Items related to Enumerability · Decidability Computability: An Introduction...
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Enumerability · Decidability Computability: An Introduction...
Stock Image
Enumerability � Decidability Computability: An Introduction to the Theory of Recursive Functions (Grundlehren der mathematischen Wissenschaften)
Published by
Springer-Verlag 1969-01-01, 1969
ISBN 10: 3642461808
ISBN 13: 9783642461804
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783642461804
Quantity: 10 available
Stock Image
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions (Grundlehren der mathematischen Wissenschaften)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642461804_new
Quantity: Over 20 available
Seller Image
Enumerability Decidability Computability
Published by
Springer Berlin Heidelberg Feb 2012, 2012
ISBN 10: 3642461808
ISBN 13: 9783642461804
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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
Quantity: 2 available
Seller Image
Enumerability Decidability Computability : An Introduction to the Theory of Recursive Functions
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642461808
ISBN 13: 9783642461804
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642461804
Quantity: 1 available
Seller Image
Enumerability · Decidability Computability
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642461808
ISBN 13: 9783642461804
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5061805
Quantity: Over 20 available
Stock Image
Enumerability . Decidability Computability
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 266 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 44793492
Quantity: 4 available
Stock Image
Enumerability Decidability Computability: An Introduction to the Theory of Recursive Functions
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 2nd reprint edition. 266 pages. 9.00x6.00x0.60 inches. In Stock. Seller Inventory # x-3642461808
Quantity: 2 available
Seller Image
Enumerability Decidability Computability
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 2012, 2012
ISBN 10: 3642461808
ISBN 13: 9783642461804
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch. Seller Inventory # 9783642461804
Quantity: 2 available
Stock Image
Enumerability . Decidability Computability
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 266. Seller Inventory # 1848021825
Quantity: 4 available
Stock Image
Enumerability Decidability Computability: An Introduction to the Theory of Recursive Functions (Grundlehren der mathematischen Wissenschaften (127))
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA77336424618086
Quantity: 1 available