69,99 €
Occasion · Bon État
Ou 17,50 € /mois
- Livraison : 25,00 €
- Livré entre le 18 et le 23 mai
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Algorithms: Main Ideas And Applications de A. L. Semenov - Livre Philosophie
0 avis sur Algorithms: Main Ideas And Applications de A. L. Semenov - Livre Philosophie
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Mobilier Art Deco
Occasion dès 47,00 €
-
Warehouse Management
Neuf dès 66,26 €
-
Dosso Dossi: Court Painter In Renaissance Ferrara
Occasion dès 55,00 €
-
La Sante Interdite
Occasion dès 71,00 €
-
Yngwie Malmsteen Anthology
1 avis
Neuf dès 49,99 €
-
Sennelier L'artisan Des Couleurs
Occasion dès 67,00 €
-
My Favorite Thing Is Monsters
1 avis
Neuf dès 50,53 €
-
The Colouring, Bronzing And Patination Of Metals
Neuf dès 74,06 €
Occasion dès 52,19 €
-
Hilgard S Introduction To Psychology Rita L. Atkinson
Occasion dès 95,99 €
-
The Ultimate Tsa Guide
Neuf dès 40,18 €
-
The Rare Record Price Guide 2026
Neuf dès 44,66 €
-
Shakespeare Comes To Broadmoor
Neuf dès 40,41 €
-
Power Electronics
Neuf dès 55,39 €
-
The Cycle Of The Year
Neuf dès 35,06 €
-
Complete Ielts Bands 6.5-7.5 Workbook Without Answers With Audio Cd
Neuf dès 38,71 €
-
Karl Blossfeldt
2 avis
Occasion dès 69,00 €
-
Pomellato
Occasion dès 80,00 €
-
Tour Auto - 25e Édition
1 avis
Neuf dès 59,00 €
Occasion dès 35,40 €
-
Storm Chasing Handbook, 2nd. Ed.
Neuf dès 64,46 €
-
Dc Finest: Superman: Kryptonite Nevermore
Neuf dès 39,19 €
Produits similaires
Présentation Algorithms: Main Ideas And Applications de A. L. Semenov
- Livre Philosophie
Sommaire:
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.
Détails de conformité du produit
Personne responsable dans l'UE