Computability and Complexity (Hardcover)
暫譯: 可計算性與複雜性 (精裝版)
Chen, Hubie
- 出版商: Summit Valley Press
- 出版日期: 2023-08-29
- 售價: $2,370
- 貴賓價: 9.8 折 $2,323
- 語言: 英文
- 頁數: 416
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 0262048620
- ISBN-13: 9780262048620
-
相關分類:
Computer-Science、Computer-networks
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
$1,176Database Management Systems, 3/e (IE-Paperback)
-
$1,200$1,140 -
$2,470$2,347 -
$2,970Natural Language Processing with PyTorch
-
$1,750$1,715 -
$1,420$1,392 -
$2,600$2,470 -
$780$616 -
$1,188Learn LLVM 12 : A beginner's guide to learning LLVM compiler tools and core libraries with C++ (Paperback)
-
$520$411 -
$3,400$3,230 -
$1,710$1,620 -
$2,650$2,597 -
$2,680$2,626 -
$600$468 -
$780$616 -
$4,500$4,410 -
$2,150$2,107 -
$480$379 -
$1,330The Language of Deception: Weaponizing Next Generation AI (Paperback)
-
$720$360 -
$2,820$2,679 -
$2,580$2,451 -
$650$513 -
$1,580$1,501
相關主題
商品描述
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
商品描述(中文翻譯)
計算理論的清晰、全面且嚴謹的介紹。
什麼是可計算的?什麼促進了計算的效率?可計算性與複雜性 提供了對計算能力和限制的數學研究的清晰、全面且嚴謹的介紹。Hubie Chen 涵蓋了計算理論的核心概念、技術、方法和問題,然後轉向幾個進階主題。這本教科書強調直觀學習和概念討論,其易於理解的方式為理解演算法和計算機的範圍與限制提供了堅實的基礎。
- 廣泛的練習題和圖表增強了數學上嚴謹材料的簡化、學生友好的呈現
- 包括對自動機理論、可計算性理論和複雜性理論的徹底探討——包括 P 與 NP 問題以及 NP 完全性理論
- 適合本科生、研究生、研究人員和專業人士
作者簡介
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.
作者簡介(中文翻譯)
Hubie Chen 是倫敦國王學院的學者。他曾在法國高等工藝學院、柏林洪堡大學和維也納大學擔任受邀職位。