0 votes 0 votes Can someone please tell me the difference between Non R.E and CoRE language ? Theory of Computation theory-of-computation + – Rajesh R asked Dec 8, 2017 Rajesh R 609 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Dec 9, 2017 reply Follow Share @Rajesh R CoREL= $\sum$* - REL // it can be non-REL non-recursively enurable are those language for which no TM exists, which can recognize it. note that if a language is REL(but not recursive), then CoREL will be non-REL 1 votes 1 votes Rajesh R commented Dec 9, 2017 reply Follow Share For Non REL, TM doesn't halt on both "yes" and "no" cases right ? For Co-RE tm halts only on "no" cases right ? @joshi_nitish. 0 votes 0 votes Please log in or register to add a comment.