发表于2024-11-02
The Annotated Turing 2024 pdf epub mobi 电子书
这本书的可读性真的很低,趣味性也不强,除了一开始看到的图灵测试的解释以外,其他的就是基于图灵的一篇关于图灵测试的论文的解释,数学太多,不好读,反正不适合一般人读,当我失去了耐心,从头拖到尾都已经觉得是浪费时间,因为学不到什么了,前面的几十页,大量列举了一些...
评分艾伦图灵 :计算理论,论可计算数及其在判定性问题上的应用 oncomputable numbers,with an application to the Entscheidungsproblem 图灵写这篇论文的动机是想解决德国数学家大卫、希尔伯特构想的一个问题,希尔伯特想寻找一种通用的方法来判定数理逻辑中的任意命题是否可证...
评分第7章中,“如果它找不到α,就会转向m-格局(德文花体字体的C)”根据英文原版或应改为德文花体字体的B; “现在我们可以说(花体的e),(花体的b, x)是机器的另一个m-格局”根据英文原版或应改为“(花体的e)(花体的b, x)”; (花体的e)(花体的b, x)同样也是机器的另一个m...
评分其实这本书我并没有读完,因为到了第二部分,即使有了作者的解释和注释,图灵的论文也确实超出了我的能力范围之外了,把“可计算函数”一章的前半部分仔细读了三四遍之后还是读不懂之后,我不得不放弃了。但是这并不影响我仍然给这本书打五星力荐。 先说这本书,我想如果没有C...
评分看到了第七章后部,发觉似乎不是IT行业的人翻译的这本书,在遇到函数overload,翻译成“过载”而非“重载”
图书标签: 计算机科学 图灵 计算机 turing AlanTuring Computer.Theory 数学 科普
(excerpts from my proposal for the book)
Anyone who has explored the history, technology, or theory of computers has likely encountered the concept of the Turing Machine. The Turing Machine is an imaginary — not even quite hypothetical — computer invented in 1936 by English mathematician Alan Turing (1912–1954) to help solve a question in mathematical logic. As a byproduct, Turing also founded the field of computability theory — the study of the abilities and limitations of digital computers.
Although the concept of the Turing Machine is well known, Turing’s original 1936 paper is only rarely read. This neglect may have something to do with the paper’s title — “On Computable Numbers, with an Application to the Entscheidungsproblem” — and perhaps the paper’s extensive use of a scary German gothic font. That’s too bad, because the paper is not only a fascinating read but a milestone in the history of computing and 20th century intellectual thought in general.
This book presents Turing’s original 36-page paper (and a follow-up 3-page correction) with background chapters and extensive annotations. Mathematical papers like Turing’s are often terse and cryptic. I have elaborated on many of Turing’s statements, clarified his discussions, and provided numerous examples.
Interwoven into the narrative are the highlights of Turing’s own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of “gross indecency,” and his early death by apparent suicide at the age of 41.
The book is divided into four parts: Parts I and II together are about 200 pages in length and cover the first 60% of Turing’s paper, encompassing the Turing Machine and computability topics. This part of the book is entirely self-contained and will be of primary interest to most readers.
Part III is a faster paced look at the remainder of Turing’s paper, which involves the implications for mathematical logic. Some readers might want to skip these chapters.
Part IV resumes the more "popular" presentation showing how the Turing Machine has become a vital tool in understanding the workings of human consciousness and the mechanisms of the universe.
Although I expect the primary readers of the book to be programmers, computer science majors, and other “techies,” I have tried my best to make the book accessible to the general reader. There is unavoidably much mathematics in the book, but I have tried to assume that the reader only has knowledge of high-school mathematics, and probably a foggy one at that.
这本书详细解读了Turing1936年的论文“On Computable Numbers, with an Application to the Entscheidungsproblem”,其中描述了Turing machine。但这本书远远不止于此,它涉及到数学的很多方面,深入浅出。关键是!!!没有过于难懂的英文单词和句式。我可以给十颗星吗?!
评分mark 读到 第6章
评分看了以后收获不大,难道是自己水平太低的缘故?
评分十分强大,既博又精。根据个人能力和兴趣,着重看了第二部分,这也是Turing论文最独特,奠定计算机科学理论基础的部分,对Turing设想的‘machine'有细致分析。可看懂原理,但许多细节需动笔动脑才能消化(对部分细节我做了偷懒处理)。第三部分讲的逻辑基础虽然学过,可要看懂关键的证明部分还是感到头大(脑小还差不多),初略了事。对Lambda Calculus也有简介,其原理学习FP都有涉及,但更深了解其历史和更原始的代表还是让人颇感成就感。第四部分对于人工智能和哲学的思索趣点多多,也是这本书读起来最轻松的部分。以Diophantus首尾呼应,非常聪明。虽是本很学术的书,80%的内容都是理论,偏抽象,读来艰难,作者闲扯能力也不错,看到一些有趣的历史段子。对早期加密和解码技术也有较好的简介。
评分尽管没读过这本书,,但我相信Petzold的书必属精品。
The Annotated Turing 2024 pdf epub mobi 电子书