This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions.