Limits of Computation
eBook - PDF

Limits of Computation

An Introduction to the Undecidable and the Intractable

  1. 279 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Limits of Computation

An Introduction to the Undecidable and the Intractable

Book details
Table of contents
Citations

About This Book

Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently. The book enables readers to understand: What does it mean

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Limits of Computation by Edna E. Reiter, Clayton Matthew Johnson in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Games. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Chapman and Hall/CRC
Year
2012
ISBN
9781439882078
Edition
1
Topic
Computer Science
Subtopic
Programming Games
Index
Computer Science

Table of contents

  1. Front Cover
  2. Contents
  3. Preface
  4. Acknowledgments
  5. About the Authors
  6. Introduction
  7. Chapter 1 - Set Theory
  8. Chapter 2 - Languages: Alphabets, Strings, and Languages
  9. Chapter 3 - Algorithms
  10. Chapter 4 - Turing Machines
  11. Chapter 5 - Turing-Completeness
  12. Chapter 6 - Undecidability
  13. Chapter 7 - Undecidability and Reducibility
  14. Chapter 8 - Classes NP and NP-Complete
  15. Chapter 9 - More NP-Complete Problems
  16. Chapter 10 - Other Interesting Questions and Classes
  17. Bibliography
  18. Back Cover