Subjects / Theory of computation

Best books to learn Theory of computation, in order

Theory of computation is cumulative in the strictest sense: each layer is defined in terms of the one below it, so skipping ahead simply doesn't work. A good path climbs the hierarchy deliberately — finite automata and regular languages, then context-free grammars and pushdown machines, then Turing machines and computability, before arriving at complexity theory and the P-versus-NP question that frames the whole field.

Build your own Theory of computation list →Browse all paths

Reading paths for theory of computation

Popular theory of computation books

Related reading

Frequently asked questions

How should I approach learning theory of computation?
Theory of computation is cumulative in the strictest sense: each layer is defined in terms of the one below it, so skipping ahead simply doesn't work. A good path climbs the hierarchy deliberately — finite automata and regular languages, then context-free grammars and pushdown machines, then Turing machines and computability, before arriving at complexity theory and the P-versus-NP question that frames the whole field.
What's a good book to start theory of computation with?
A strong starting point is Computational complexity by Christos H. Papadimitriou. The ordered reading paths above show exactly where it fits and what to read next.
What should I read after theory of computation?
Once you have the fundamentals, explore closely related subjects like ASP.NET Core development, Flask web development, Unreal Engine game development.

Related subjects