Enumerability decidability computability von hermes (10 Ergebnisse)

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.

245 S./pp., Originalleineneinband (publisher's cloth binding), Bibliotheksexemplar in gutem Zustand / exlibrary in good condition ( Einband gering gebrauchsspurig / binding shows minor tear and wear, Stempel auf Titel / title stamped, Rückenschildchen / lettering pannel to the spine, Block gut / contents clean, keine Unterstreichungen oder Anstreichungen / no underlining or remarks, in Folie eingeschlagen / wrapped up in foil), (Die Grundlehren der mathematischen Wissenschaften 127), Sprache: deutsch. …

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.

Cloth. Zustand: Good. Zustand des Schutzumschlags: Good. Type: Book N.B. Small plain label to ffep. Half title page a little loose. Rubbing and chipping to edges and corners of D/J with several tears and some marks. (MATHEMATICS).

IX, 245 pp. with a few figures, Sprache: Englisch Gewicht in Gramm: 600 Groß 8°, Original-Leinen (Hardcover), Bibliotheks-Exemplar (ordnungsgemäß entwidmet) mit leichten Rückständen vom Rückenschild, Stempel auf Titel, insgesamt gutes und innen sauberes Exemplar, (library copy in good condition).

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

Zustand: New. In English.

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.…

Zustand: New.