text1: What branch of theoretical computer science deals with broadly classifying computational problems by difficulty and class of relationship?
text2: A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm.