This preview shows page 1. Sign up to view the full content.
Unformatted text preview: w 2i } . 4. Do problem 4.17 from the textbook (both editions). 5. Do problem 4.18 from the textbook (both editions). Note: A language L is coTuringrecognizable if and only if L is Turingrecognizable. 6. If you have the 1 st edition of the textbook, do problem 4.21, and if you have the 2 nd edition, do problem 4.28....
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