3,470 views
2 votes
2 votes
L={<M> : M is a TM that accepts all even numbers }

is it recursive/R.E??

2 Answers

1 votes
1 votes
allthe even numbers  so Tyes is subset of Tno which is non monotonic property of rice theoram hence it is non RE
1 votes
1 votes
I think this is UNDECIDABLE!

statement "It accepts ALL even number"

now suppose i am giving Even numbers as Input, say it accepts all of them , Still i can't say that it will accept the next Even input..May be ,it will go to infinite loop!

so it is Undecidable

Related questions

3 votes
3 votes
1 answer
1
3 votes
3 votes
2 answers
2
1 votes
1 votes
1 answer
4
Mk Utkarsh asked Sep 15, 2018
1,460 views
$D = \left \{ M \mid \ M \text{ is a TM that accepts the input string } x \right \}$What is complement of D and is it Decidable, Turing recognizable or not Turing recogni...