28. Theory of computation
Study finite automata, regular languages, context-free grammars, Turing machines, decidability, and computability. This chapter explains the boundary between problems computers can solve, recognize, or never decide in general.