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
 Spring '08
 LONG
 decidable properties, decidable property

Click to edit the document details