I will describe a natural sequence of generalizations going from Turing style computational complexity theory and the P vs NP problem to the complexity theory of algebraic varieties. I will then explain how to use universal circuits to make an NP-complete sequence of projective varieties.