Jump to ratings and reviews
Rate this book

Computability and Complexity

Rate this book
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 materialIncludes thorough treatment of automata theory, computability theory, and complexity theory—including the P versus NP question and the theory of NP-completenessSuitable for undergraduate and graduate students, researchers, and professionals

406 pages, Kindle Edition

Published August 29, 2023

4 people are currently reading
10 people want to read

About the author

Hubie Chen

1 book

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.