Clearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas.
"synopsis" may belong to another edition of this title.
Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.
Introduction. 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. Selected Bibliography.
"About this title" may belong to another edition of this title.
Seller: Greenworld Books, Arlington, TX, U.S.A.
Condition: good. Fast Free Shipping â" Good condition book with a firm cover and clean, readable pages. Shows normal use, including some light wear or limited notes highlighting, yet remains a dependable copy overall. Supplemental items like CDs or access codes may not be included. Seller Inventory # GWV.1133187811.G
Seller: SellOnline2020, PLAISTOW, NH, U.S.A.
Soft cover. Condition: New. 3rd Edition. Brand New International Edition textbook. Some book may show sales disclaimer such as "Not for Sale or Restricted in US" on the cover page but it is absolutely legal to use in US or Canada. Ship from Multiple Locations, including Asia , Hong Kong ,Taiwan , US or Canada depend on stock location. Seller Inventory # 001436
Seller: GoldBooks, Denver, CO, U.S.A.
Condition: new. Seller Inventory # 60D73_49_1133187811