Tag
This article announces a free online course by Tim Roughgarden that covers fundamental concepts in computer science, including Turing machines, the halting problem, algorithmic efficiency, NP-completeness, and the P vs NP problem.