Intermediate
Theory of Computation
Q49 / 100
What is reduction in computability theory?
Correct! Well done.
Incorrect.
The correct answer is B) Transforming instances of problem A to problem B so that a solver for B solves A, proving B at least as hard as A
B
Correct Answer
Transforming instances of problem A to problem B so that a solver for B solves A, proving B at least as hard as A
Explanation
If A reduces to B (A ≤ B), then B is at least as hard as A. If A is undecidable and A reduces to B, then B is also undecidable. Reductions are the primary tool for undecidability proofs.
Progress
49/100