Was (wer) ist decision problems - definition

YES/NO PROBLEM IN COMPUTER SCIENCE

Decidability problems; Decision procedure; Decision problems; Word problem (computability); Decidable problem; Decision version; Decision variant; Solvable problem

decision problem

<theory> A problem with a yes/no answer. Determining whether some potential solution to a question is actually a solution or not. E.g. "Is 43669" a prime number?". This is in contrast to a "search problem" which must find a solution from scratch, e.g. "What is the millionth prime number?". See decidability. (1996-05-03)

Decision (European Union)

LEGISLATIVE ACT OF THE EUROPEAN UNION

Decision (European Union law); Council Decision; EU decision; European union decision; European Union decision

In European Union law, a decision is a legal instrument which is binding upon those individuals to which it is addressed.Per Article 288 of the Treaty on the Functioning of the European Union (formerly Article 249 TEC).

https://en.wikipedia.org/wiki/Decision_(European_Union)

Decision theory

STUDY OF AN AGENT'S CHOICES

Decision Theory; Formal decision methods; Decision science; Decision sciences; Empirical decision theory; Decision strategy; Statistical decision theory; Agency dilema; Uncertainty modeling; Uncertainty Modeling; Choice under uncertainty; Decision making under risk; Decision making under uncertainty; Theory of choice; Normative decision theory; Descriptive decision theory; Prescriptive decision theory; Heuristics in decision making

Decision theory (or the theory of choice; not to be confused with choice theory) is a branch of applied probability theory concerned with the theory of making decisions based on assigning probabilities to various factors and assigning numerical consequences to the outcome.

https://en.wikipedia.org/wiki/Decision_theory

Wikipedia

Decision problem

In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers x and y, does x evenly divide y?". The answer is either 'yes' or 'no' depending upon the values of x and y. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem. A decision procedure for the decision problem "given two numbers x and y, does x evenly divide y?" would give the steps for determining whether x evenly divides y. One such algorithm is long division. If the remainder is zero the answer is 'yes', otherwise it is 'no'. A decision problem which can be solved by an algorithm is called decidable.

Decision problems typically appear in mathematical questions of decidability, that is, the question of the existence of an effective method to determine the existence of some object or its membership in a set; some of the most important problems in mathematics are undecidable.

The field of computational complexity categorizes decidable decision problems by how difficult they are to solve. "Difficult", in this sense, is described in terms of the computational resources needed by the most efficient algorithm for a certain problem. The field of recursion theory, meanwhile, categorizes undecidable decision problems by Turing degree, which is a measure of the noncomputability inherent in any solution.

https://en.wikipedia.org/wiki/Decision problem