Models of Computation: Exploring the Power of Computing - Couverture rigide

Savage, John E.

Couverture rigide

ISBN 10 : 0201895390 ISBN 13 : 9780201895391

Editeur : Pearson, 1997

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 spacetime 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 Pcomplete and Npcomplete problems. Models of Computation provides the first textbook treatment of spacetime 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.

A propos du livre

À propos de l'auteur

John E. Savage is a professor of Computer Science at Brown University. He is a Guggenheim Fellow, a Fellow of the IEEE, ACM, and the AAAS, and a recipient of a Fulbright-Hayes grant. Professor Savage is also the author of The Complexity of Computing (Wiley and Sons, 1976) and a co-author of The Mystical Machine (Addison-Wesley, 1986).

0201895390AB04062001

À propos de la quatrième de couverture

"A magnificent piece of work! Models of Computation gives a superb treatment of modern complexity theory, in a perfect textbook style. 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

Détails de l'édition

• Éditeur: Pearson
• Date d'édition: 1997
• Langue: anglais
• ISBN 10: 0201895390
• ISBN 13: 9780201895391
• Reliure: Relié
• Nombre de pages: 600
• Coordonnées du fabricant: non disponible
• Personne responsable: Riccardo Bacigalupo; riccardo.bacigalupo@sanoma.it; ; Sanoma Italia Via Arconati, 1 �; Milano; 20135; Italie