l12-handout

l12-handout - Outline A language that is RE but not...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 12: Undecidability, cont. David Dill Department of Computer Science 1 Outline A language that is RE but not recursive. Other undecidable problems. Rice’s theorem 2 A Language that is RE but not Recursive L u = { ( M, w ) | M accepts w } . Theorem: L u is RE. L u is accepted by the “Universal Turing Machine” M U . Idea: To check ( M, w ) , simulate M on w using one tape to hold M , use the second tape to simulate the tape of M (so the second tape starts out with w on it). 3 L u is not Recursive Theorem: L u is not recursive. Proof sketch: By reduction from L d . First, we prove that L u is not RE, by reduction. Suppose there were a TM, M , accepting L u . So, M would inputs ( M i , w ) and accepts if M i rejects w . Then we could construct a TM M 0 to accept L d , as follows: Given input string M i , M 0 first constructs the string ( M i , M i ) , then runs M on ( M i , M i ) L ( M 0 ) = L d , since M 0 accepts M i iff M i does not accept M i . But L d is not RE, so L u is not RE. Therefore, L u is not recursive, so L u must not be recursive (since the complement of a recursive language must be recursive). 4
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Other Properties of Turing Machines Problem: Is L ( M i ) empty? L e = { M i | L ( M i ) = ∅} . L ne = { M i | L ( M i ) 6 = ∅} . Theorem
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/08/2011 for the course CS 154 taught by Professor Motwani,r during the Winter '08 term at Stanford.

Page1 / 4

l12-handout - Outline A language that is RE but not...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online