The Theory of Computation

The Theory of Computation

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical issues in computing. The book establishes clear limits to computation, relates these limits to resource usage, and explores possible avenues of compromise through approximation and randomization. The book also provides an overview of current areas of research in theoretical computer science that are likely to have a significant impact on the practice of computing within the next few years.

Table of Contents:
(Each chapter concludes with Exercises and a Bibliography.) 1. Introduction. Motivation and Overview. History. 2. Preliminaries. Numbers and their Representation. Problems, Instances, and Solutions. Asymptotic Notation. Graphs. Alphabets, Strings, and Languages. Functions and Infinite Sets. Pairing Functions. Cantor’s Proof: the Technique of Diagonalization. Implications for Computability. 3. Finite Automata and Regular Languages. Introduction. States and Automata. Finite Automata as Language Acceptors. Determinism and Nondeterminism. Checking vs. Computing. Properties of Finite Automata. Equivalence of Finite Automata. Epsilon Transitions. Regular Expressions. Definitions and Examples. Regular Expressions and Finite Automata. Regular Expressions from Deterministic Finite Automata. The Base Case. The Inductive Step. Completing the Proof. Reviewing the Construction of Regular Expressions from Finite Automata. The Pumping Lemma and Closure Properties. The Pumping Lemma. Closure Properties of Regular Languages. Ad Hoc Closure Properties. Conclusion. 4. Universal Models of Computation. Encoding Instances. Choosing a Model of Computation. Issues of Computability. The Turing Machine. Multitape Turing Machines. The Register Machine. Translation Between Models. Model Independence. Turing Machines as Enumerators and Acceptors. 5. Computability Theory. Primitive Recursive Functions. Defining Primitive Recursive Functions. Ackermann’s Function and the Grzegorczyk Hierarchy. Partial Recursive Functions. Arithmetization: Encoding a Turing Machine. Programming Systems. Recursive and R.E. Sets. Rice’s Theorem and the Recursion Theorem. Degrees of Unsolvability. 6. Complexity Theory: Foundations. Reductions. Reducibility Between Problems. Reductions and Complexity Classes. Classes of Complexity. Hierarchy Theorems. Model-Independent Complexity Classes. Deterministic Complexity Classes. Certificates and Nondeterminism. Complete Problems. NP-Completeness: Cook’s Theorem. Space Completeness. Polynomial Space. Polylogarithmic Space. Provably Intractable Problems. 7. Proving Problems Hard. Some Important NP-Complete Problems. Some P-Completeness Proofs. From Decision to Optimization and Enumeration. Turing Reductions and Search Problems. The Polynomial Hierarchy. Enumeration Problems. 8. Complexity Theory in Practice. Circumscribing Hard Problems. Restrictions of Hard Problems. Promise Problems. Strong NP-Completeness. The Complexity of Approximation. Definitions. Constant-Distance Approximations. Approximation Schemes. Fixed-Ratio Approximations and the Class OptNP. No Guarantee Unless P equals NP. The Power of Randomization. 9. Complexity Theory: The Frontier. Introduction. The Complexity of Specific Instances. Average-Case Complexity. Parallelism and Communication. Parallelism. Models of Parallel Computation. When Does Parallelism Pay? Communication and Complexity. Interactive Proofs and Probabilistic Proof Checking. Interactive Proofs. Zero-Knowledge Proofs. Probabilistically Checkable Proofs. Complexity and Constructive Mathematics. References. A. Proofs. Quod Erat Demonstrandum, or What is a Proof? Proof Elements. Proof Techniques. Construction: Linear Thinking. Contradiction: Reductio ad Absurdum. Induction: the Domino Principle. Diagonalization: Putting it all Together. How to Write a Proof. Practice. 0201258285T04062001


Best Sellers


Product Details
  • ISBN-13: 9780201258288
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 165 mm
  • No of Pages: 464
  • Spine Width: 24 mm
  • Width: 240 mm
  • ISBN-10: 0201258285
  • Publisher Date: 10 Oct 1997
  • Binding: Hardback
  • Language: English
  • Series Title: English
  • Weight: 745 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
The Theory of Computation
Pearson Education (US) -
The Theory of Computation
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

The Theory of Computation

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA