We discuss algorithmic complexity, and learn the difference (if indeed there is one) between P and NP problems.
