🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Decidability and Complexity: all 10 questions

Quiz: Decidability and Complexity · Question 7 of 10

To prove a new problem B undecidable by reduction, you show that:

To prove a new problem B undecidable by reduction, you show that:

  1. A.B can be solved by a DFA
  2. B.A decider for B could be used to build a decider for a known undecidable problem A
  3. C.B has a polynomial-time algorithm
  4. D.A can be solved using B's grammar
Answer & explanation

Correct answer: A decider for B could be used to build a decider for a known undecidable problem A

If B were decidable, A would be too — a contradiction.

Can you get the rest right without peeking?

Take the timed Quiz: Decidability and Complexity quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →