Here's a short story:

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. 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. 

A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying the amount of resources needed to solve them, such as time and storage. Other complexity measures are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what computers can and cannot do. (End of story)

Provide your best guess for the following question. Give ONLY the guess, no other words or explanation.

For example:

Guess: <most likely guess, as short as possible; not a complete sentence, just the guess!>

Here are a few examples of questions and answers:

Question: What does computational complexity theory focus on?
Guess: classifying computational problems according to their inherent difficulty

Question: What make a problem difficult?
Guess: if its solution requires significant resources

Question: What is one complexity measure used?
Guess: the amount of communication

Question: What is their preferred Bible translation?
Guess: unknown

Question: Any more complexity measures used?
Guess: Yes

Question: Name another.
Guess: the number of gates in a circuit

Now answer the following question in the same format.

Question: Any more?

Yes