This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS381 Homework 11: Problem 1 Prove that the halting problem for Turing machine is undecidable. We can think of the Turing machine for the following pseudocode. The function halt takes two para- meters as input. The first parameter is a program and the second is the argument to that program. We send breakHalt in as the argument to itself. The program therefore says that if breakHalt doesnt halt then we are done, otherwise we loop forever. This creates a contradiction, therefore the halting problem is undecidable. function breakHalt(string s) if halt(s, s) = false return true else loop forever 1 Rices Theorem: Every nontrivial property of the RE languages is undecidable. Proof: Assume , the empty language is not in the nontrivial property P. Let L be a nonempty language in P and M L be a Turing Machine accepting L. Explanation: The reduction from L u to L P will be sufficient in proving L P is undecidable since weve already established that L u is. We need to construct a Turing Machine M...
View Full Document
- Fall '05