Computability and Complexity
Language: English
Published by The MIT Press, 2023
- Hardcover
- Used

Seller: HPB-Diamond, Dallas, TX, U.S.A.HPB-Diamond
5-star seller
AbeBooks seller since September 15, 2017
Hardcover
Condition: Used - Very good
US$ 16.00
US$ 3.75 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.
Seller Inventory # S_446598710
- Title
- Computability and Complexity
- Author
- Chen, Hubie
- Publisher
- The MIT Press
- Publication year
- 2023
- Condition
- Very Good
- Binding
- hardcover
- Language
- English
- ISBN 10
- 0262048620
- ISBN 13
- 9780262048620
A clear, comprehensive, and rigorous introduction to the theory of computation.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
- Extensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous material
- Includes thorough treatment of automata theory, computability theory, and complexity theory—including the P versus NP question and the theory of NP-completeness
- Suitable for undergraduate and graduate students, researchers, and professionals
"Synopsis" may belong to another edition of this title.
About the Author
Hubie Chen is an academic at King’s College London. He has held invited positions at École polytechnique, Humboldt-Universität zu Berlin, and Universität Wien.
"About the title" may belong to another edition of this title.
HPB-Diamond
Dallas, TX, U.S.A.
5-star seller
AbeBooks seller since September 15, 2017
Shipping rates within U.S.A.
| Item | 4 to 14 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 3.75 | US$ 6.99 |
Payment methods
Store description
Half Price Books has been connecting readers to great books since 1972. Customer service is our top priority.
Seller's business information
Half Price Books, Records, Magazines, Inc.
5803 East Northwest Highway
Dallas, TX U.S.A. 75231