- Home
- Computers
- Programming
- Computability and Complexity
Computability and Complexity
List Price:
$65.00
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Hubie Chen
Format:
Hardcover
Pages:
416
Publisher:
MIT Press (August 29, 2023)
Language:
English
ISBN-13:
9780262048620
ISBN-10:
0262048620
Weight:
28.7oz
Dimensions:
7.25" x 9.25" x 0.95"
File:
RandomHouse-PRH_Book_Company_PRH_PRT_Onix_full_active_D20260405T171453_155746865-20260405.xml
Folder:
RandomHouse
List Price:
$65.00
Case Pack:
18
As low as:
$50.05
Publisher Identifier:
P-RH
Discount Code:
A
QuickShip:
Yes
Audience:
General/trade
Country of Origin:
United States
Pub Discount:
65
Imprint:
The MIT Press
Overview
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.
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
