Explaining computational complexity theory

Question

Assuming some background in mathematics, how would you give a general overview of computational complexity theory to the naive?

I am looking for an explanation of t

Answer 1

Depending on how long you have, maybe it would be best to start at DFA, NDFA, and then show that they are equivalent. Then they understand ND vs. D, and will understand regular expressions a lot better as a nice side effect.