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 ...
Read More
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."
Read Less
Add this copy of Enumerability · Decidability Computability: an to cart. $85.20, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1969 by Springer Verlag.
Add this copy of Enumerability · Decidability Computability: an to cart. $138.28, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 1969 by Springer Verlag.
Add this copy of Enumerability, Decidability, Computability: an to cart. $88.98, like new condition, Sold by Alien Bindings rated 5.0 out of 5 stars, ships from BALTIMORE, MD, UNITED STATES, published 1965 by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. 1965 edition in yellow cloth. The covers look great. The spine ends are lightly indented. The binding is tight. The front flyleaf is stamped. The interior pages are clean and unmarked. Electronic delivery tracking will be issued free of charge. 245 pages.
