What kind of problems are one of the main topics studied in computational complexity theory?
A decision problem can be viewed as a formal language, where the members of the language are instances whose output is yes, and the non-members are those instances whose output is no.