Computability and Complexity

By: Hubie Chen

Write A Review

eText | 29 August 2023

At a Glance

Format
ePUB

eText

$66.67

or 4 interest-free payments of $16.67 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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