Log In

Recent questions tagged rice

0 votes
0 answers
L1 = { <M> | M is a TM and | L (M) <=1 } L2= { <M> | M is a TM and | L (M) >=1 } NOW QUESTION IS WHICH ARE RECURSIVE ENUMERABLE AND WHICH ARE NOT ???? I JUST READ BASICS OF rice theorem DONT PRACTICE MUCH QUESTIONS ON THIS I SOLVED ABOVE QUESTION BY THIS... ... string length >= 0...... and REL_yes as string length >= 1 . REL_YES is a proper subset of REL _NO . so we can say that it is also non re
asked Nov 14, 2018 in Theory of Computation Deepanshu 122 views
0 votes
0 answers
Problem : It is undecidable whether an arbitrary Turing Machines halt within 10 steps? Let consider Two Turing machine in which first one it is halt in 10 steps while in other it is not , so as it is undecidable. @arjun sir ,@bikram sir or @others
asked Dec 1, 2017 in Theory of Computation hem chandra joshi 426 views
2 votes
1 answer
L(M)=RL(Recursive Language) ... M is a TM... Question/Doubt:- L(m) is decidable or not (Explain by the concept of Rice Theorem)???
asked Oct 6, 2017 in Theory of Computation hs_yadav 410 views
To see more, click for the full list of questions or popular tags.