Theory and languages
Computability and complexity
Turing machines, problems no program can solve, and what P versus NP actually asks.
About 30 hours of study.
Where to learn it
Read
Models of Computation (lecture notes)
Jeff Erickson
Chapters on Turing machines and undecidability
Section not checked yet
Watch
Practise
No practice set picked yet.
Suggest oneWhich roles ask for it
- GATE computer science to get hired
Before and after
Computability and complexity
Opens up
Nothing else on the map yet.