Skip to main content
Taylor & Francis Group Logo
    Advanced Search

    Click here to search products using title name,author name and keywords.

    • Login
    • Hi, User  
      • Your Account
      • Logout
      Advanced Search

      Click here to search products using title name,author name and keywords.

      Breadcrumbs Section. Click here to navigate to respective pages.

      Book

      Limits of Computation
      loading

      Book

      Limits of Computation

      DOI link for Limits of Computation

      Limits of Computation book

      An Introduction to the Undecidable and the Intractable

      Limits of Computation

      DOI link for Limits of Computation

      Limits of Computation book

      An Introduction to the Undecidable and the Intractable
      ByEdna E. Reiter, Clayton Matthew Johnson
      Edition 1st Edition
      First Published 2012
      eBook Published 24 October 2012
      Pub. Location New York
      Imprint Chapman and Hall/CRC
      DOI https://doi.org/10.1201/b12992
      Pages 279
      eBook ISBN 9780429189463
      Subjects Computer Science, Mathematics & Statistics
      Share
      Share

      Get Citation

      Reiter, E.E., & Johnson, C.M. (2012). Limits of Computation: An Introduction to the Undecidable and the Intractable (1st ed.). Chapman and Hall/CRC. https://doi.org/10.1201/b12992

      ABSTRACT

      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

      TABLE OF CONTENTS

      chapter 1|12 pages

      ◾ Set Theory

      chapter 2|20 pages

      ◾ Languages: Alphabets, Strings, and Languages

      chapter 3|28 pages

      ◾ Algorithms

      chapter 4|20 pages

      ◾ Turing Machines

      chapter 5|32 pages

      ◾ Turing-Completeness

      chapter 6|16 pages

      ◾ Undecidability

      chapter 7|32 pages

      ◾ Undecidability and Reducibility

      chapter 8|24 pages

      ◾ Classes NP and NP-Complete

      chapter 9|40 pages

      ◾ More NP-Complete Problems

      chapter 10|28 pages

      ◾ Other Interesting Questions and Classes

      T&F logoTaylor & Francis Group logo
      • Policies
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
      • Journals
        • Taylor & Francis Online
        • CogentOA
        • Taylor & Francis Online
        • CogentOA
      • Corporate
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
      • Help & Contact
        • Students/Researchers
        • Librarians/Institutions
        • Students/Researchers
        • Librarians/Institutions
      • Connect with us

      Connect with us

      Registered in England & Wales No. 3099067
      5 Howick Place | London | SW1P 1WG © 2022 Informa UK Limited