This book focuses on actual computational models and finite issues. It includes an introduction to more contemporary themes like space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity in addition to conventional topics like formal languages, automata, and complexity classes.
The early introduction of P-complete and NP-complete issues serves as an illustration of how these subjects are interwoven across the entire book.
The first textbook to address space-time tradeoffs and memory structures is Models of Computation. Both a thorough introduction to computational complexity and a succinct, up-to-date discussion of circuit complexity is provided. The book contains parallelism throughout.
