How can I show that the following language is neither semi decidable nor co-semi decidable without using Rice's Theorem?
Further for the following language, how would I show that it IS co-semi decidable but not decidable for |Σ| > 1
Asked
Active
Viewed 61 times
0
-
3What did you try? Where did you get stuck? We're happy to help with conceptual issues but just solving homework-style exercises for you is unlikely to really help you. – David Richerby Jan 23 '17 at 15:04
-
The titular question is funny, because using Rice's theorem is not a reduction. ;) That said, check out our reference question! – Raphael Jan 23 '17 at 20:19
-
Please ask only one question per post. These two are indeed related -- do you see the connection? – Raphael Jan 23 '17 at 20:20