Using a decider for Lto construct a decider for , is called reducing Lto. Note:Once we prove that a certain language LIntroductionTMATMAis undecidable, we can prove that some other language, say L’ ,is undecidable, by reducing L’to L.51. We know that Ais undecidable. 2. We want to prove Bis undecidable. 3. We assume that Bis decidable and use this Schematic of a Reductionassumption to prove that Ais decidable.4. We conclude that Bis undecidable.Note:The reduction is fromAtoB.61. We know that Ais undecidable.
This is the end of the preview.
access the rest of the document.