(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.
这本书对我来说真的很难读懂。看到大段大段的各种稀奇古怪的数学符号我就发求。但是这并不妨碍我从另一个角度来重新了解了图灵、数学、计算机….去年的时候曾听过Jeff讲过的一个session:《世界及宇宙的终极答案》。我敢确定至少一半的内容都是来自这本书。 图灵在论文中描述了...
評分介绍了图灵的数学理论,由浅入深,大学六级英语水平加高中数学知识要求。暂时只扫了一眼,看完后补上详尽的评论。
評分在这之前因为简单看过一些哲学普及书,一直纠结于唯物论->因果论->机械论和自由意志之间的矛盾。我是相信唯物论的,但是又觉得自由意志这个东西并不能由简单的因果关系决定,直到看到了这本书。 这本书详细分析了图灵机的不可判定性问题和哥德尔的不确定性原理,在我看起来,虽...
評分鉴于是科普向就不发博客了.. 微积分发明后, 全欧洲的数学物理学家们疯狂的享受这种方法带来的方便. 那时的数学是带有浓厚的应用目的的, 几乎所有数学都是为解物理问题而存在, 人们用微积分求解物体间的作用, 天体的运动, 却未顾及方法的严谨性. 即使有怀疑的声音, 人们还是随...
評分其实这本书我并没有读完,因为到了第二部分,即使有了作者的解释和注释,图灵的论文也确实超出了我的能力范围之外了,把“可计算函数”一章的前半部分仔细读了三四遍之后还是读不懂之后,我不得不放弃了。但是这并不影响我仍然给这本书打五星力荐。 先说这本书,我想如果没有C...
這本書詳細解讀瞭Turing1936年的論文“On Computable Numbers, with an Application to the Entscheidungsproblem”,其中描述瞭Turing machine。但這本書遠遠不止於此,它涉及到數學的很多方麵,深入淺齣。關鍵是!!!沒有過於難懂的英文單詞和句式。我可以給十顆星嗎?!
评分半途而廢瞭
评分看瞭以後收獲不大,難道是自己水平太低的緣故?
评分圖靈《論可計算數》箋。比較少見的帶讀者讀原始文獻的科普書。
评分如作者所說,把書中引用的部分摘下來就是完整的圖靈論文. 這基本上就是一本對論文的注釋瞭,附帶一些曆史生平和相關人物擴展. 盡管整體下來個人比較吃力,但看到諸如解釋為什麼沒有一個general的process去判定一個machine是否是circle-free的時候,還是會有被顛覆的快感.
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有