Undecidable problem
Decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.
Nº Q3502995 ★
Common · Knowledge
Undecidable problem
Decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.
Text: Wikipédia, CC BY-SA 4.0. · Image: RobinK (CC BY-SA 4.0) ·
Related cards
Entscheidungsproblem
In computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Nº Q11030584 ★★
Halting problem
Problem of determining whether a given program will finish running or continue forever
Nº Q622849 ★★★
Wicked problem
Problem that is difficult or impossible to solve because of incomplete, contradictory, and changing requirements that are often difficult to recognize
Nº Q2891260 ★★
Inverse problem
Process of calculating from a set of observations the causal factors that produced them, or deducing the causes or parameters that we cannot directly observe from their effects
Nº Q1567213 ★★
Embarrassingly parallel
Problem which is trivially divided into parallelized tasks
Nº Q5369501 ★★
Computational complexity theory
Theoretical computer science and mathematics theory that classifies problems according to their inherent difficulty, and relates those classes to each other
Nº Q205084 ★★