Computation as a Universal and Fundamental Concept
Summary
The article discusses computation as a fundamental concept, tracing from Turing's early work to the halting problem, NP-completeness, and the P vs NP question. It explains how algorithmic shortcuts enable efficient solutions, the limits of those shortcuts highlighted by NP-hard problems like the Traveling Salesman Problem, and the potential implications for cryptography, AI, and quantum computing. The piece promotes Roughgarden's course materials, including video lectures and a chapter index.