Decision problems are one of the central objects of study in computational complexity theory. A decision problem is a special type of computational problem whose answer is either yes or no, or alternately either 1 or 0. 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. The objective is to decide, with the aid of an algorithm, whether a given input string is a member of the formal language under consideration. If the algorithm deciding this problem returns the answer yes, the algorithm is said to accept the input string, otherwise it is said to reject the input.
What kind of problems are one of the main topics studied in computational complexity theory? What are the two simple word responses to a decision problem? What are the two integer responses to a decision problem? What will the output be for a member of the language of a decision problem? What answer denotes that an algorithm has accepted an input string?