In what is hopefully going to be a series of talks, I will survey very natural extremal combinatorial questions arising from complexity theory. I will point out several questions and report some progress. In the first chapter we will look at a relaxation of VC dimension and prove a Sauer-Shelah type theorem.