(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.
Charles Petzold确实是一位大牛,作为windows程序员来说,《Windows程序设计》是一本经典之中的经典。不过对于我来说,熟悉大牛的深入浅出式的说明还是在《编码的奥秘》这本书(原句叫 coding,现在再版,书名叫《编码》),在那本书里面,指引着我们寻找计算机制造的基本原理...
评分鉴于是科普向就不发博客了.. 微积分发明后, 全欧洲的数学物理学家们疯狂的享受这种方法带来的方便. 那时的数学是带有浓厚的应用目的的, 几乎所有数学都是为解物理问题而存在, 人们用微积分求解物体间的作用, 天体的运动, 却未顾及方法的严谨性. 即使有怀疑的声音, 人们还是随...
评分中文书名叫做《图灵的秘密》,副标题叫“他的生平、思想及论文解读”,内容读来和此有些差异。书的主要内容是解读图灵1936年发表的论文“On Computable Numbers, with an Application to the Entscheidungsproblem”(“论可计算数及其在判定性问题上的应用”),在这个大主题...
评分其实这本书我并没有读完,因为到了第二部分,即使有了作者的解释和注释,图灵的论文也确实超出了我的能力范围之外了,把“可计算函数”一章的前半部分仔细读了三四遍之后还是读不懂之后,我不得不放弃了。但是这并不影响我仍然给这本书打五星力荐。 先说这本书,我想如果没有C...
评分之所以没有选力荐不是因为书不够好,而是这本书对于大部分人来说很难全部读懂,我算是一个数学爱好者,虽然自己数学能力已经完全处于大学以下水平了。读这本书需要很多思考,毕竟他不是传记,不是故事,而是对一个完整的知识体系的详尽分析和解读,多谢作者在前面写了大量的补...
p155,“If the configurations marked χ and у do not match (as they won't in our example), ”,根据上下文并参考中文版,“won't”或应改为“will” 批注请参见评论
评分尽管没读过这本书,,但我相信Petzold的书必属精品。
评分p155,“If the configurations marked χ and у do not match (as they won't in our example), ”,根据上下文并参考中文版,“won't”或应改为“will” 批注请参见评论
评分接下来要写一个图灵机原型,向图灵致敬
评分接下来要写一个图灵机原型,向图灵致敬
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有