750 views
2 votes
2 votes

L={<M>: M is a TM that accepts all even numbers } Why it is not recursively enumerable language???

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Arpit Dhuriya asked May 24, 2017
399 views
Can anybody please explain this reduction and rice theorem.http://www.cs.rice.edu/~nakhleh/COMP481/Thanks
0 votes
0 votes
0 answers
2