Languages and machines
by Thomas A. Sudkamp · first published 1988
5mentions
2recommended by
3HN commenters
2010–2022first – last mentioned
67% recommend33% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…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
on “Ask HN: Good books on computation” ↗…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…
on “The Strangest Book on the Theory of Computation (2009)” ↗…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…
on “Eliminate the Computer Science major” ↗…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.
on “Eliminate the Computer Science major” ↗…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.
on “Scooping the Loop Snooper (2000)” ↗