So computational complexity is the problem of actually finding the hardness of problems and from the prospective of a theoretician who studies complexity theory, the stuff that we've been doing so far talking about devising algorithms and proving their running times, that's just part of the story, that's just upper bound determination.