Computability and Complexity

Computability and Complexity

Hardback (23 Aug 2023)

Save $14.20

  • RRP $79.23
  • $65.03
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within two working days

Publisher's Synopsis

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. 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

Book information

ISBN: 9780262048620
Publisher: The MIT Press
Imprint: The MIT Press
Pub date:
DEWEY: 511.352
DEWEY edition: 23/eng20230429
Number of pages: cm
Weight: 838g
Height: 185mm
Width: 237mm
Spine width: 24mm