000			01384 a2200181 4500
003			OSt
005			20250910124536.0
008			250910b |||||||| |||| 00| 0 eng d
020			_a9780262048620
082			_a511.352 _bC420c
100			_aChen, Hubie
245			_aComputability and complexity _cHubie Chen
260			_bMIT Press _c2023 _aCambridge
300			_avi, 394p
520			_aWhat 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
650			_aComputational complexity
942			_cBK
999			_c567645 _d567645