This preview shows page 1. Sign up to view the full content.
Unformatted text preview: , and NotDEC TM are not Turingrecognizable, where E TM = { M L ( M ) = ∅ } , FINITE TM = { M L ( M ) is a finite set} , DEC TM = { M L ( M ) is Turingdecidable} , and NotDEC TM = { M L ( M ) is not Turingdecidable} . 4. Use Rice's Lemma 2 to show that ALL TM and INF TM are not Turingrecognizable, where ALL TM = { M L ( M ) = M * } and INF TM = { M L ( M ) is an infinite set} ....
View
Full
Document
This note was uploaded on 04/13/2010 for the course CSE 725 taught by Professor Long during the Spring '08 term at Ohio State.
 Spring '08
 LONG

Click to edit the document details