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
- Preț: 353.84 lei
- 24% Preț: 728.15 lei
- Preț: 410.21 lei
- 24% Preț: 587.87 lei
- 17% Preț: 498.73 lei
- Preț: 592.75 lei
- 20% Preț: 692.49 lei
- 24% Preț: 893.28 lei
- 20% Preț: 824.73 lei
- 24% Preț: 632.96 lei
- 15% Preț: 596.69 lei
- 15% Preț: 714.49 lei
- Preț: 333.01 lei
- 15% Preț: 473.16 lei
- Preț: 356.49 lei
- Preț: 484.43 lei
- 15% Preț: 452.79 lei
- Preț: 456.66 lei
- 15% Preț: 708.75 lei
- Preț: 423.08 lei
- 15% Preț: 444.29 lei
- 15% Preț: 527.79 lei
- 15% Preț: 589.65 lei
- Preț: 353.40 lei
- 18% Preț: 727.66 lei
- Preț: 387.96 lei
- 15% Preț: 454.74 lei
- 15% Preț: 481.03 lei
- Preț: 464.55 lei
- Preț: 348.77 lei
- Preț: 362.04 lei
- Preț: 488.12 lei
- 15% Preț: 447.57 lei
- Preț: 419.81 lei
- Preț: 388.52 lei
- Preț: 419.21 lei
- 15% Preț: 581.01 lei
- Preț: 497.75 lei
- Preț: 360.53 lei
- Preț: 387.75 lei
- Preț: 419.81 lei
- 18% Preț: 725.75 lei
- Preț: 453.78 lei
Preț: 386.39 lei
Nou
Puncte Express: 580
Preț estimativ în valută:
73.95€ • 76.92$ • 61.97£
73.95€ • 76.92$ • 61.97£
Carte tipărită la comandă
Livrare economică 13-27 martie
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.