Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing

In Stock
SKU: DADAX0201895390
UPC: 9780201895391
Brand: Addison-Wesley
Condition: New
Regular price$164.72
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

In Models of Computation: Exploring the Power of Computing, John Savage reexamines 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 Pcomplete and NPcomplete 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 spacetime tradeoffs, memory hierarchies, parallel computation, and circuit complexity, are integrated throughout the text with an emphasis on finite problems and concrete computational models

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: How many pages does this book have? A: This book has six hundred seventy-two pages. It provides a comprehensive overview of models of computation and complexity classifications.
  • Q: What is the binding type of this book? A: The binding type is hardcover. This ensures durability and makes it suitable for frequent use.
  • Q: What are the dimensions of this book? A: The dimensions are eight inches in length, one point seventy-five inches in width, and nine point seventy-six inches in height.
  • Q: Who is the author of this book? A: The author is John E. Savage. He is known for his work in theoretical computer science.
  • Q: What is the main focus of the book? A: The focus is on resource tradeoffs and complexity classifications in computational models. It emphasizes practical approaches over theoretical abstractions.
  • Q: Is this book suitable for beginners? A: Yes, it is suitable for readers with some background in computer organization. The content is accessible and progressively builds on concepts.
  • Q: How does this book approach complex topics? A: The book uses circuits to simulate machines with memory, making complex topics like P-complete and NP-complete problems more understandable.
  • Q: What topics are covered in this book? A: It covers formal languages, automata, space-time tradeoffs, memory hierarchies, and circuit complexity among others. This variety enhances the learning experience.
  • Q: Can this book be used in a classroom setting? A: Yes, it is ideal for classroom use. The structured presentation of topics encourages discussion and deeper understanding among students.
  • Q: How should I store this book? A: Store it upright on a shelf to prevent bending. Keeping it in a cool, dry place will help maintain its condition.
  • Q: Is this book safe for children? A: The content is intended for adult readers and students in higher education. Parental discretion is advised for younger audiences.
  • Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for a return or exchange. Most sellers have customer service policies to assist you.
  • Q: Does this book include exercises or problems? A: Yes, it includes exercises and problems to reinforce learning. These are essential for students to apply concepts practically.
  • Q: Is there a digital version of this book available? A: The availability of a digital version may vary. Check with the publisher or online retailers for eBook options.
  • Q: What makes this book unique? A: Its emphasis on realistic computational models and practical applications distinguishes it from other theoretical texts. It bridges theory with real-world computing.

Recently Viewed