{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture15_Part2

Lecture15_Part2 - Introduction 1 We know that A is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Using a decider for L to construct a decider for , is called reducing L to . Note: Once we prove that a certain language L Introduction TM A TM A is undecidable, we can prove that some other language, say L’ , is undecidable, by reducing L’ to L . 5 1. We know that A is undecidable. 2. We want to prove B is undecidable. 3. We assume that B is decidable and use this Schematic of a Reduction assumption to prove that A is decidable. 4. We conclude that B is undecidable. Note: The reduction is from A to B . 6 1. We know that A is undecidable.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}