Vous en avez un à vendre ?

Modèles de calcul : explorer le pouvoir - couverture rigide, par Savage John E. HC LN

peter and faye's
(198)
Inscrit comme vendeur particulier
En conséquence, les droits des consommateurs découlant de la législation européenne ne s'appliquent pas. La Garantie client eBay continue de s'appliquer pour la plupart des achats.
75,00 USD
Environ64,24 EUR
ou Offre directe
État :
Comme neuf
Livraison :
5,97 USD (environ 5,11 EUR) USPS Media MailTM.
Lieu où se trouve l'objet : Mamaroneck, New York, États-Unis
Délai de livraison :
Estimé entre le lun. 18 août et le sam. 23 août à 94104
Les délais de livraison sont estimés au moyen de notre méthode exclusive basée sur la distance entre l'acheteur et le lieu où se trouve l'objet, le service de livraison sélectionné, l'historique des livraisons du vendeur et d'autres facteurs. Les délais de livraison peuvent varier, notamment pendant les périodes de pointe.
Retours :
Retours refusés.
Paiements :
     Diners Club

Achetez en toute confiance

Garantie client eBay
Obtenez un remboursement si vous ne recevez pas l'objet que vous avez commandé. En savoir plusGarantie client eBay - la page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :236112683410

Caractéristiques de l'objet

État
Comme neuf: Livre qui semble neuf, mais ayant déjà été lu. La couverture ne présente aucune marque ...
Book Title
Models of Computation: Exploring the Power of Computing
Topic
Exploration
ISBN
9780201895391

À propos de ce produit

Product Identifiers

Publisher
Addison-Wesley Longman, Incorporated
ISBN-10
0201895390
ISBN-13
9780201895391
eBay Product ID (ePID)
327652

Product Key Features

Number of Pages
600 Pages
Language
English
Publication Name
Models of Computation : Exploring the Power of Computing
Publication Year
1997
Subject
Computer Science, System Theory
Type
Textbook
Author
John E. Savage
Subject Area
Computers, Science
Format
Trade Paperback

Dimensions

Item Height
1.4 in
Item Weight
45.9 Oz
Item Length
9.5 in
Item Width
7.8 in

Additional Product Features

Intended Audience
College Audience
LCCN
97-024307
Dewey Edition
21
Illustrated
Yes
Dewey Decimal
004
Table Of Content
Your book fills the gap which all of us felt existed too long. Congratulations on this excellent contribution to our field." --Jan van Leeuwen, Utrecht University "This is an impressive book. The subject has been thoroughly researched and carefully presented. All the machine models central to the modern theory of computation are covered in depth; many for the first time in textbook form. Readers will learn a great deal from the wealth of interesting material presented." --Andrew C. Yao, Professor of Computer Science, Princeton University "Models of Computation" is an excellent new book that thoroughly covers the theory of computation including significant recent material and presents it all with insightful new approaches. This long-awaited book will serve as a milestone for the theory community." --Akira Maruoka, Professor of Information Sciences, Tohoku University "This is computer science." --Elliot Winard, Student, Brown University In Models of Computation: Exploring the Power of Computing, John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint reflects a pedagogy motivated by the growing importance of computational models that are more realistic than the abstract ones studied in the 1950s, '60s and early '70s. Assuming only some background in computer organization, Models of Computation uses circuits to simulate machines with memory, thereby making possible an early discussion of P-complete and NP-complete problems. Circuits are also used to demonstrate that tradeoffs between parameters of computation, such as space and time, regulate all computations by machines with memory. Full coverage of formal languages and automata is included along with a substantive treatment of computability. Topics such as space-time tradeoffs, memory hierarchies, parallel computation, and circuit complexity, are integrated throughout the text with an emphasis on finite problems and concrete computational models FEATURES: Includes introductory material for a first course on theoretical computer science. Builds on computer organization to provide an early introduction to P-complete and NP-complete problems. Includes a concise, modern presentation of regular, context-free and phrase-structure grammars, parsing, finite automata, pushdown automata, and computability. Includes an extensive, modern coverage of complexity classes. Provides an introduction to the advanced topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity, with parallelism integrated throughout. Contains over 200 figures and over 400 exercises along with an extensive bibliography. ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http://hepg.awl.com/rep-locator . 0201895390B04062001
Synopsis
The focus of this book is on finite problems and concrete computational models. It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity. These topics are integrated throughout the book as illustrated by the early introduction of P-complete and NP-complete problems. Models of Computation provides the first textbook treatment of space-time tradeoffs and memory hierarchies. It gives a comprehensive introduction to computational complexity as well as a brief but modern coverage of circuit complexity. Parallelism is integrated throughout the book., This text focuses on finite problems and emphasizes concrete models of machines and programming styles. Using problems defined over infinite domains and abstract machine models as models, emphasis is given to concrete problems of the kind found in algorithms textbooks, as well as machine models related to current technology. The book integrates the theme of parallelism throughout the book (for example, circuits are presented as parallel machines) and studies the exchanges between space, time and other resources on a variety of machine models.
LC Classification Number
QA76.S333 1998

Description de l'objet fournie par le vendeur

À propos de ce vendeur

peter and faye's

99,5% d'évaluations positives627 objets vendus

Membre depuis févr. 2020
Répond en général sous 24 heures
Inscrit comme vendeur particulierEn conséquence, les droits des consommateurs découlant de la législation européenne ne s'appliquent pas. La Garantie client eBay continue de s'appliquer pour la plupart des achats.
Visiter la BoutiqueContacter

Évaluations détaillées du vendeur

Moyenne pour les 12 derniers mois
Description exacte
4.9
Frais de livraison raisonnables
4.9
Livraison rapide
5.0
Communication
5.0

Évaluations du vendeur (210)

Toutes les évaluations
Positives
Neutres
Négatives