(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.
最近一年断断续续在读《图灵的秘密》,现在终于有点眉目了。读图灵机时,第一台图灵机打印010101……倒好明白,第二台图灵机打印0010110111011110……就不太明白了,反复读了若干遍,终于有点明白了。但作者介绍的计算2的平方根的图灵机不懂。就跳过去了。直接看子程序,其中大...
评分可能的勘误: p155,“If the configurations marked χ and у do not match (as they won't in our example), ”,根据上下文并参考中文版,“won't”或应改为“will” 批注: p183,184 批注: “Summary of the second proof Less than one page long, the passage from pre...
评分《图灵的秘密》是关于图灵1936年那篇开创性论文的解读,内容很多很难,需要的背景知识包括数理逻辑,lambda演算,以及一些基本的数论。读完的笔记也许都会比原书多,这里想简洁或者宏观性地谈谈几个主角之间的“故事”。 实际上说争论更准确。 初(我目前所知道的),大神莱...
评分最近一年断断续续在读《图灵的秘密》,现在终于有点眉目了。读图灵机时,第一台图灵机打印010101……倒好明白,第二台图灵机打印0010110111011110……就不太明白了,反复读了若干遍,终于有点明白了。但作者介绍的计算2的平方根的图灵机不懂。就跳过去了。直接看子程序,其中大...
评分之所以没有选力荐不是因为书不够好,而是这本书对于大部分人来说很难全部读懂,我算是一个数学爱好者,虽然自己数学能力已经完全处于大学以下水平了。读这本书需要很多思考,毕竟他不是传记,不是故事,而是对一个完整的知识体系的详尽分析和解读,多谢作者在前面写了大量的补...
尽管没读过这本书,,但我相信Petzold的书必属精品。
评分如作者所说,把书中引用的部分摘下来就是完整的图灵论文. 这基本上就是一本对论文的注释了,附带一些历史生平和相关人物扩展. 尽管整体下来个人比较吃力,但看到诸如解释为什么没有一个general的process去判定一个machine是否是circle-free的时候,还是会有被颠覆的快感.
评分尽管没读过这本书,,但我相信Petzold的书必属精品。
评分看了整个人都不好了
评分整合宇宙会是一个图灵机么
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有