Computability and Complexity

Hubie Chen

$160

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

MIT Press
03 October 2023

Computing: general

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

By: Hubie Chen
Imprint: MIT Press
Country of Publication: United States
Dimensions: Height: 229mm, Width: 178mm,
Weight: 567g
ISBN: 9780262048620
ISBN 10: 0262048620
Pages: 416
Publication Date: 03 October 2023
Audience: General/trade , ELT Advanced
Format: Hardback
Publisher's Status: Active

Preface ix Introduction xiii Agreements xv 1 Automata Theory 1 2 Computability Theory 71 3 Complexity Theory 141 4 Further Complexity Theory 275 References 375 Index 381

Hubie Chen is an academic at King's College London. He has held invited positions at cole polytechnique, Humboldt-Universit t zu Berlin, and Universit t Wien.

SALE ON NOW! PROMOTIONS

Computability and Complexity

Hubie Chen

$160

Hardback

See Inside

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S