enumerability decidability computability introduction von hans hermes (12 Ergebnisse)

Hardcover. Zustand: Very Good. Zustand des Schutzumschlags: No Dust Jacket. Second Revised Edition. Small 4to 9" - 11" tall; 245 pages.

Hardcover. Zustand: Very Good-. English translation of the German book of the same date: Die Grundlehren Der Mathematischen Wissenschaften in Enzeldarstellungen Mit Besonderer Beruchsichtigung Der Anwendungsgebiete, concerning algorithms/recursive functions. Yellow boards w/black titling, lightly worn, large ink mark on back board. Binding tight; Text clean. Name of former owner inside front board. Professional book seller with storefront since 1975. All orders carefully packaged and promptly shipped.

Hardcover. Zustand: Good.

Zustand: Good. Good condition. No Dust Jacket Vol. 127. (recursive functions, algorithms, Go?del's theorem) A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.

Super octavo hardcover (VG) in d/w (VG); all our specials have minimal description to keep listing them viable. They are at least reading copies, complete and in reasonable condition, but usually secondhand; frequently they are superior examples. Ordering more than one book may reduce your overall postage costs.

Hardcover. Zustand: Good. Zustand des Schutzumschlags: Good. Fading around the dj edges along with minor edge wear all around. Boards a bit old feeling with some wear/bumping particularly to the top and bottom of spine. Unmarked. Binding is decent.

1.Auflage,. IX, 245 Seiten Einband etwas berieben, Bibl.Ex., sonst guter und sauberer Zustand Sprache: Englisch Gewicht in Gramm: 670 8° , Leinen- Hardcover/Pappeinband,

PF. Zustand: New.

Zustand: New. In.

Hardcover. Zustand: Gut. Bln., Springer 1965. IX, 245 p. OCloth. (slightly stained).- Grundlehren der mathematischen Wissenschaften, 127.- Throughout slightly browned.

Paperback. Zustand: Brand New. 2nd reprint edition. 266 pages. 9.00x6.00x0.60 inches. In Stock.

Taschenbuch. Zustand: 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.