Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: Grundlehren der mathematischen Wissenschaften, cartea 127
Autor Hans Hermes Traducere de Gabor T. Herman, O. Plassmannen Limba Engleză Paperback – 29 feb 2012
Din seria Grundlehren der mathematischen Wissenschaften
- 24%
Preț: 654.97 lei - 17%
Preț: 539.72 lei - 18%
Preț: 867.65 lei -
Preț: 641.48 lei -
Preț: 371.84 lei - 18%
Preț: 747.16 lei -
Preț: 417.52 lei - 24%
Preț: 685.05 lei - 15%
Preț: 573.68 lei - 24%
Preț: 828.39 lei - 18%
Preț: 874.17 lei - 18%
Preț: 875.70 lei - 15%
Preț: 455.01 lei - 15%
Preț: 688.12 lei - 24%
Preț: 1208.66 lei - 20%
Preț: 615.40 lei - 15%
Preț: 435.43 lei -
Preț: 343.01 lei -
Preț: 403.27 lei -
Preț: 465.91 lei -
Preț: 406.97 lei - 15%
Preț: 427.26 lei - 15%
Preț: 507.50 lei - 15%
Preț: 566.94 lei -
Preț: 340.03 lei - 18%
Preț: 699.51 lei -
Preț: 373.24 lei - 15%
Preț: 437.32 lei - 15%
Preț: 462.55 lei -
Preț: 446.83 lei -
Preț: 348.34 lei -
Preț: 469.46 lei - 15%
Preț: 430.41 lei -
Preț: 403.83 lei - 18%
Preț: 709.63 lei -
Preț: 373.76 lei -
Preț: 403.27 lei - 15%
Preț: 558.62 lei -
Preț: 478.73 lei -
Preț: 346.88 lei -
Preț: 373.03 lei -
Preț: 403.83 lei -
Preț: 436.47 lei
Preț: 371.73 lei
Nou
Puncte Express: 558
Preț estimativ în valută:
65.77€ • 77.32$ • 57.60£
65.77€ • 77.32$ • 57.60£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642461804
ISBN-10: 3642461808
Pagini: 264
Ilustrații: XII, 250 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:Softcover reprint of the original 2nd ed. 1969
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Grundlehren der mathematischen Wissenschaften
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642461808
Pagini: 264
Ilustrații: XII, 250 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:Softcover reprint of the original 2nd ed. 1969
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Grundlehren der mathematischen Wissenschaften
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1. Introductory Reflections on Algorithms.- § 1. The Concept of Algorithm.- § 2. The Fundamental Concepts of the Theory of Constructivity.- § 3. The Concept of Turing Machine as an Exact Mathematical Substitute for the Concept of Algorithm.- § 4. Historical Remarks.- 2. Turing Machines.- § 5. Definition of Turing Machines.- § 6. Precise Definition of Constructive Concepts by means of Turing Machines.- § 7. Combination of Turing Machines.- § 8. Special Turing Machines.- § 9. Examples of Turing-Computability and Turing-Decidability.- 3. ?-Recursive Functions.- § 10. Primitive Recursive Functions.- § 11. Primitive Recursive Predicates.- § 12. The ?-Operator.- § 13. Example of a Computable Function which is not Primitive Recursive.- § 14. ?-Recursive Functions and Predicates.- 4. The Equivalence of Turing-Computability and ?-Recursiveness.- § 15. Survey. Standard Turing-Computability.- § 16. The Turing-Computability of ?-Recursive Functions.- § 17. Gödel Numbering of Turing Machines.- § 18. The ?-Recursiveness of Turing-Computable Functions. Kleene’s Normal Form.- 5. Recursive Functions.- § 19. Definition of Recursive Functions.- § 20. The Recursiveness of ?-Recursive Functions.- § 21. The ?-Recursiveness of Recursive Functions.- 6. Undecidable Predicates.- § 22. Simple Undecidable Predicates.- § 23. The Unsolvability of the Word Problem for Semi-Thue Systems and Thue Systems.- § 24. The Predicate Calculus.- § 25. The Undecidability of the Predicate Calculus.- § 26. The Incompleteness of the Predicate Calculus of the Second Order.- § 27. The Undecidability and Incompleteness of Arithmetic.- 7. Miscellaneous.- § 28. Enumerable Predicates.- § 29. Arithmetical Predicates.- § 30. Universal Turing Machines.- § 31. ?-K-Definability.- §32. The Minimal Logic of Fitch.- § 33. Further Precise Mathematical Replacements of the Concept of Algorithm.- § 34. Recursive Analysis.- Author and Subject Index.