Status Updates From Introduction to the Theory ...

Starting regular language chapter 1. This write-up is very nice to read, the author is a good writer.

I don't know which level this book is aimed at, but Chapter 0 is written wonderfully.

This textbook is top-tier, a joy to read

I had heard of Kolmogorov complexity but never realized it was definable in such an intuitive and simple way (264). Very neat.

The proof of Kleene's second recursion theorem for Turing machines was really cool, and the construction of general-purpose self-referential Turing machines was much more intuitively well-motivated than versions of this proof I've seen using binary code on register machines. (Chapter 6)

Rereading this in preparation for Immerman's Descriptive Complexity. It's less dense than I remember, filled with examples and exercises. Easy to skim through. First couple of chapters generate maybe 2 pages of notes.