Lecture15_Part1 - B If we know that does not have a...

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

View Full Document Right Arrow Icon
Introduction to Computability Theory Lecture15: Reductions 1 Prof. Amos Israeli The rest of the course deals with an important tool in Computability and Complexity theories, namely: Reductions . Introduction The reduction technique enables us to use the undecidability of to prove many other languages undecidable. 2 TM A A reduction always involves two computational problems. Generally speaking, the idea is to show that a solution for some problem induces a solution for problem
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online