Get Free Shipping on orders over $79
Computability and Complexity - Hubie Chen
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Go digital and save!

Computability and Complexity

By: Hubie Chen

Hardcover | 3 October 2023

At a Glance

Hardcover


RRP $160.00

$120.99

24%OFF

or 4 interest-free payments of $30.25 with

 or 

Ships in 25 to 30 business days

A clear, comprehensive, and rigorous introduction to the theory of computation.

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

More in Mathematical Theory of Computation

Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$129.75

13%
OFF
BEADING WITH ALGORITHMS : CELLULAR AUTOMATA IN PEYOTE STITCH - Gwen  Fisher
Applied Mathematics with F# - Sudipta Mukherjee
Axiomatic Set Theory : An Introduction - George Tourlakis