Algorithms: Main Ideas and Applications: Mathematics and Its Applications, cartea 251
Autor Vladimir Uspensky, A.L. Semenoven Limba Engleză Hardback – 31 mar 1993
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 907.25 lei 6-8 săpt. | |
| SPRINGER NETHERLANDS – 7 dec 2010 | 907.25 lei 6-8 săpt. | |
| Hardback (1) | 913.32 lei 6-8 săpt. | |
| SPRINGER NETHERLANDS – 31 mar 1993 | 913.32 lei 6-8 săpt. |
Din seria Mathematics and Its Applications
- 20%
Preț: 960.38 lei - 15%
Preț: 632.63 lei - 18%
Preț: 908.91 lei - 15%
Preț: 623.39 lei - 15%
Preț: 626.82 lei - 15%
Preț: 568.82 lei -
Preț: 379.31 lei - 18%
Preț: 965.60 lei - 15%
Preț: 564.25 lei - 15%
Preț: 633.26 lei - 15%
Preț: 623.52 lei - 15%
Preț: 581.54 lei -
Preț: 379.89 lei - 15%
Preț: 626.68 lei -
Preț: 405.52 lei -
Preț: 379.51 lei - 15%
Preț: 679.01 lei -
Preț: 376.17 lei -
Preț: 374.91 lei - 20%
Preț: 566.92 lei - 15%
Preț: 628.73 lei - 15%
Preț: 564.42 lei - 20%
Preț: 624.91 lei -
Preț: 380.46 lei - 15%
Preț: 578.70 lei - 15%
Preț: 626.68 lei - 15%
Preț: 624.01 lei -
Preț: 377.32 lei - 15%
Preț: 624.01 lei - 15%
Preț: 618.64 lei -
Preț: 383.03 lei
Preț: 913.32 lei
Preț vechi: 1113.81 lei
-18% Nou
Puncte Express: 1370
Preț estimativ în valută:
161.59€ • 188.54$ • 141.28£
161.59€ • 188.54$ • 141.28£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792322108
ISBN-10: 079232210X
Pagini: 270
Ilustrații: XII, 270 p.
Dimensiuni: 156 x 234 x 18 mm
Greutate: 0.58 kg
Ediția:1993
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
ISBN-10: 079232210X
Pagini: 270
Ilustrații: XII, 270 p.
Dimensiuni: 156 x 234 x 18 mm
Greutate: 0.58 kg
Ediția:1993
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
Notation and Terminology.- 1.0 Preliminary notions of the theory of algorithms: constructive objects and aggregates; local properties and local actions.- 1.1 The general notion of an algorithm as an independent (separate) concept.- 1.2 Representative computational models.- 1.3 The general notion of a calculus as an independent (separate) concept.- 1.4 Representative generating models.- 1.5 Interrelations between algorithms and calculuses.- 1.6 Time and Space as complexities of computation and generation.- 1.7 Computable functions and generable sets; decidable sets; enumerable sets.- 1.8 The concept of a ?-recursive function.- 1.9 Possibility of an arithmetical and even Diophantine representation of any enumerable set of natural numbers.- 1.10 Construction of an undecidable generable set.- 1.11 Post’s reducibility problem.- 1.12 The concept of a relative algorithm, or an oracle algorithm.- 1.13 The concept of a computable operation.- 1.14 The concept of a program; programs as objects of computation and generation.- 1.15 The concept of a numbering and the theory of numberings.- 1.16 First steps in the invariant, or machine-independent, theory of complexity of computations.- 1.17 The theory of complexity and entropy of constructive objects.- 1.18 Convenient computational models.- 2.1 Investigations of mass problems.- 2.2 Applications to the foundations of mathematics: constructive semantics.- 2.3 Applications to mathematical logic: formalized languages of logic and arithmetic.- 2.4 Computable analysis.- 2.5 Numbered structures.- 2.6 Applications to probability theory: definitions of a random sequence.- 2.7 Applications to information theory: the algorithmic approach to the concept of quantity of information.- 2.8 Complexity bounds for particular problems.- 2.9 Influenceof the theory of algorithms on algorithmic practice.- Appendix. Probabilistic Algorithms (How the Use of Randomness Makes Computations Shorter).- A.1 Preliminary remarks.- A.2 Main results.- A.3 Formal definitions.- References.- Author Index.