Cover of Understanding Computation

Understanding Computation

From Simple Machines to Impossible Programs

by Tom Stuart · first published 2013

26mentions
13recommended by
17HN commenters
2013–2026first – last mentioned

76% recommend24% neutral

Why HN recommends it

Introduction to computation theory for working programmers, using Ruby to build toy interpreters, Turing machines and lambda calculus from examples and exercises. Suits those without a CS theory background.

Summarised by Claude from recommending comments

Finally, you can learn computation theory and programming language design in an engaging, practical way. Understanding Computation explains theoretical computer science in a context you’ll recognize, helping you appreciate why these ideas matter and how they can inform your day-to-day programming. Rather than use mathematical notation or an unfamiliar academic programming language like Haskell or Lisp, this book uses Ruby in a reductionist manner to present formal semantics, automata theory, and functional programming with the lambda calculus. It’s ideal for programmers versed in modern lan

Affiliate links. As an Amazon Associate I earn from qualifying purchases.

Mentions per year

40 2007: 0 mentions2008: 0 mentions2009: 0 mentions2010: 0 mentions2011: 0 mentions2012: 0 mentions2013: 2 mentions2014: 1 mention2015: 4 mentions2016: 1 mention2017: 3 mentions2018: 1 mention2019: 2 mentions2020: 1 mention2021: 4 mentions2022: 3 mentions2023: 1 mention2024: 1 mention2025: 1 mention2026: 1 mention200720172026

What Hacker News says

Keyboard shortcuts

/
Focus search
j / k
Next / previous book
Enter
Open focused book
Esc
Close / go back
g h
Go to Home
g t
Go to Top all-time
g m
Go to Most recommended
g r
Go to Rising
g f
Go to For You
?
Show this help