Amazon cover image
Image from Amazon.com

Introduction to the theory of computation / Michael Sipser.

By: Material type: TextTextPublisher: Boston, MA : Cengage Learning, 2013Edition: Third editionDescription: xxii, 458 pages : illustrations ; 25 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781133187790
Subject(s): DDC classification:
  • 511.35 SI.I 2013 23
LOC classification:
  • QA267  .S56 2013
Contents:
Part 1: Automata and languages 1. Regular languages ; 2. Context-free languages -- Part 2: Computability theory. 3. The Church-Turing thesis ; 4. Decidability ; 5. Reducibility ; 6. Advanced topics in computability theory -- Part 3: Complexity theory. 7. Time complexity ; 8. Space complexity ; 9. Intractability ; 10. Advanced topics in complexity theory.
Summary: Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210080
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210081
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210082
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210083
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210084
Books Books The Knowledge Hub Library Computing 511.35 SI.I 2013 (Browse shelf(Opens below)) Available 210085

Includes bibliographical references (pages 443-447) and index.

Part 1: Automata and languages 1. Regular languages ; 2. Context-free languages -- Part 2: Computability theory. 3. The Church-Turing thesis ; 4. Decidability ; 5. Reducibility ; 6. Advanced topics in computability theory -- Part 3: Complexity theory. 7. Time complexity ; 8. Space complexity ; 9. Intractability ; 10. Advanced topics in complexity theory.

Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing.

There are no comments on this title.

to post a comment.