Unformatted text preview: B . If we know that does not have a solution, we may deduce that is also insolvable. In this case we say that is reducible to . 3 In the context of undecidability: If we want to prove that a certain language L is undecidable. We assume by way of contradiction that is decidable, and show that a decider for , can be used to devise a decider for . Since is undecidable, so is the language 4...
View
Full
Document
This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.
 Winter '99
 Paturi

Click to edit the document details