…https://news.ycombinator.com/item?id=18325689） - Charles Petzlod 的《The Annotated Turing》 - H. Barendregt 的《Introduction to Lambda Calculus》（做做里面的习题/证明） - Philip Wadler 的《Propositions as Types》 - Thomas Sudkamp 的《Languages and Machines》第三部分
…https://news.ycombinator.com/item?id=18325689) - The Annotated Turing by Charles Petzlod - Introduction to Lambda Calculus by H. Barendregt (do the exercises/proofs) - Propositions as Types by Philip Wadler - Part III. of Languages and Machines by Thomas Sudkamp
……顺序： - M. Sipser 的《Introduction to the Theory of Computation》[第一部分] - Torben A. Mogensen 的《Introduction to Compiler Design》 - P. Linz 的《An introduction to Formal Languages and Automata》 - Thomas A. Sudkamp 的《Languages and Machines》 >楼主的很多反对意见显得有些吹毛求疵 我亲自拿过那本书，翻过书页，亲眼见过它的排版。真不是夸张。看起来就像是某个人……
…order: - "Introduction to the Theory of Computation" [Part I] by M. Sipser - "Introduction to Compiler Design" by Torben A. Mogensen - "An introduction to Formal Languages and Automata" by P. Linz - "Languages and Machines" by Thomas A. Sudkamp >Many of OP's objections come off as petty I have had the book in my hands, I have turned the pages and seen the typesetting myself. It's not an exaggeration. It looks like one…
……其实根本没多少数学。复杂度理论，编辑补充：还有算法分析确实需要重温微积分里的一些求和和极限，但教的角度非常实用。我的《语言与机器》（Languages and Machines）课表面上是所有课里最“偏理论”的，却成了我最喜欢的一门课，除了基础的数字逻辑外，它完全不涉及数学。这并不是说它不严谨或不形式化；它只是不……
…didn't have much math at all. Complexity theory edit: and algorithm analysis did require brushing up on some summations and limits from calculus, but it was taught from a very practical perspective. My Languages and Machines class, ostensibly the most "theoretical" of all, has been my favorite class, and other than some basic digital logic it had no math at all. That's not to say it wasn't formal or rigorous; it just wasn't…
……想学编程，事实并非如此。我读的是密苏里州立大学，计算机系一点名气都没有，但即使是成绩不算拔尖的学生，也经常把离散数学或《语言与机器》（Languages and Machines）之类的课程列为培养计划里自己最喜欢的课。
…want to learn to program, that's not true. I go to Missouri State University, not at all known for its CS department, and even students that don't do very well often list classes like Discrete Math or Languages and Machines as their favorite courses in the curriculum.
……人。如果程序 X 停机，你能造出一个不停机的程序 Y，这算“显而易见”吗？你能理解一个程序可以作为另一个程序的输入字符串吗？如果可以，那么 Sudkamp 的《Languages and Machines》（我 90 年代本科时的教材）里关于停机问题的证明，确实只需一页纸就能搞定。
…person. Is it "obvious" you can produce program Y that doesn't halt if program X halts? Do you understand one program can be taken as input string of another? If so, the Halting Problem proof in Sudkamp's Languages and Machines, my undergraduate text in the 90s, can indeed take just a page.
…https://news.ycombinator.com/item?id=18325689） - Charles Petzlod 的《The Annotated Turing》 - H. Barendregt 的《Introduction to Lambda Calculus》（做做里面的习题/证明） - Philip Wadler 的《Propositions as Types》 - Thomas Sudkamp 的《Languages and Machines》第三部分
…https://news.ycombinator.com/item?id=18325689) - The Annotated Turing by Charles Petzlod - Introduction to Lambda Calculus by H. Barendregt (do the exercises/proofs) - Propositions as Types by Philip Wadler - Part III. of Languages and Machines by Thomas Sudkamp
……顺序： - M. Sipser 的《Introduction to the Theory of Computation》[第一部分] - Torben A. Mogensen 的《Introduction to Compiler Design》 - P. Linz 的《An introduction to Formal Languages and Automata》 - Thomas A. Sudkamp 的《Languages and Machines》 >楼主的很多反对意见显得有些吹毛求疵 我亲自拿过那本书，翻过书页，亲眼见过它的排版。真不是夸张。看起来就像是某个人……
…order: - "Introduction to the Theory of Computation" [Part I] by M. Sipser - "Introduction to Compiler Design" by Torben A. Mogensen - "An introduction to Formal Languages and Automata" by P. Linz - "Languages and Machines" by Thomas A. Sudkamp >Many of OP's objections come off as petty I have had the book in my hands, I have turned the pages and seen the typesetting myself. It's not an exaggeration. It looks like one…
……其实根本没多少数学。复杂度理论，编辑补充：还有算法分析确实需要重温微积分里的一些求和和极限，但教的角度非常实用。我的《语言与机器》（Languages and Machines）课表面上是所有课里最“偏理论”的，却成了我最喜欢的一门课，除了基础的数字逻辑外，它完全不涉及数学。这并不是说它不严谨或不形式化；它只是不……
…didn't have much math at all. Complexity theory edit: and algorithm analysis did require brushing up on some summations and limits from calculus, but it was taught from a very practical perspective. My Languages and Machines class, ostensibly the most "theoretical" of all, has been my favorite class, and other than some basic digital logic it had no math at all. That's not to say it wasn't formal or rigorous; it just wasn't…
……想学编程，事实并非如此。我读的是密苏里州立大学，计算机系一点名气都没有，但即使是成绩不算拔尖的学生，也经常把离散数学或《语言与机器》（Languages and Machines）之类的课程列为培养计划里自己最喜欢的课。
…want to learn to program, that's not true. I go to Missouri State University, not at all known for its CS department, and even students that don't do very well often list classes like Discrete Math or Languages and Machines as their favorite courses in the curriculum.
……人。如果程序 X 停机，你能造出一个不停机的程序 Y，这算“显而易见”吗？你能理解一个程序可以作为另一个程序的输入字符串吗？如果可以，那么 Sudkamp 的《Languages and Machines》（我 90 年代本科时的教材）里关于停机问题的证明，确实只需一页纸就能搞定。
…person. Is it "obvious" you can produce program Y that doesn't halt if program X halts? Do you understand one program can be taken as input string of another? If so, the Halting Problem proof in Sudkamp's Languages and Machines, my undergraduate text in the 90s, can indeed take just a page.