楼主: igs816
491 34

[书籍推荐] What Can Be Computed: A Practical Guide to the Theory of Computation [推广有奖]

大师

76%

还不是VIP/贵宾

-

威望
8
论坛币
1651517 个
学术水平
2383 点
热心指数
2996 点
信用等级
2165 点
经验
413805 点
帖子
4540
精华
52
在线时间
2378 小时
注册时间
2007-8-6
最后登录
2018-9-20

igs816 在职认证  发表于 2018-7-11 11:05:04 |显示全部楼层
195gk1nhxhoydf3okmtdqx13z.jpg

Princeton University Press (May 1, 2018) | ISBN: 0691170665 | 408 pages | PDF

An accessible and rigorous textbook for introducing undergraduates to computer science theory
What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference.
The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing's original 1936 computing machines, the connections between undecidability and Gödel's incompleteness theorem, and Karp's famous set of twenty-one NP-complete problems.
Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book's examples and other content allow readers to view demonstrations of―and to experiment with―a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation.
  • An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation
  • Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding
  • Gives equal emphasis to computability and complexity
  • Includes special topics that demonstrate the profound nature of key ideas in the theory of computation
  • Lecture slides and Python programs are available at whatcanbecomputed.com

本帖隐藏的内容

What Can Be Computed - A Practical Guide to the Theory of Computation.pdf (4.87 MB, 售价: 10 个论坛币)




本帖被以下文库推荐

stata SPSS
peterxu1969 发表于 2018-7-11 11:06:45 |显示全部楼层
thanks for giving
回复

使用道具 举报

ekscheng 发表于 2018-7-11 11:21:11 |显示全部楼层
回复

使用道具 举报

yazxf 发表于 2018-7-11 11:21:22 |显示全部楼层
谢谢你的书!
回复

使用道具 举报

军旗飞扬 发表于 2018-7-11 11:33:46 |显示全部楼层
谢谢分享
回复

使用道具 举报

imcooler 发表于 2018-7-11 13:40:53 |显示全部楼层
感谢分享
回复

使用道具 举报

HappyAndy_Lo 发表于 2018-7-11 13:49:44 |显示全部楼层
回复

使用道具 举报

pgbing 在职认证  发表于 2018-7-11 14:43:29 |显示全部楼层
回复

使用道具 举报

凯旋の王者 学生认证  发表于 2018-7-11 14:55:43 |显示全部楼层
嘻嘻,前来学习~
回复

使用道具 举报

小陆家嘴 发表于 2018-7-11 15:09:34 |显示全部楼层
beginning python
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 我要注册

GMT+8, 2018-9-21 05:11