Recursive and Recursive Enumerable Languages in Theory of Computation | GATECSE | TOC

[@shivanshuvikramsingh6096]

Please accept our thanks for a great presentation Sir 🙏🙏

[@coderwork8335]

Your explanation is very clear

[@anjaliverma905]

Short and precise 😊

[@Abhishekkumar-rm2te]

u made this easy to understand

[@taukirsheikh9405]

Very clear to understand Thx for making the video

[@THEGATEHUB]

Thanks a lot man for your appreciation... Please share my Vedios with your friends.. For further communication you can contact me at instagram..

[@shraddharajput9106]

Help full videos🎉

[@jannatkhan7225]

You are awesome!!

[@dalsukhnaneradalsukhnanera2862]

What a talent

[@mariakhan5715]

It helped me a lot. Thanks a lot.

[@anirbanchatterjee9286]

Thank u very much big brother... Thx for clearing my doubt in this topic.. 👏👏✌️✌️

[@THEGATEHUB]

Thanks for your appreciation brow.. For further communication you can contact me at instagram..

[@anirbanchatterjee9286]

@@THEGATEHUB Insta id...

[@THEGATEHUB]

Please go to about section on my KZbin channel and click on instagram then I hope you will find my instagram id.. Thanks brow

[@vinspatel3944]

good explanation

[@THEGATEHUB]

Thanks for your appreciation.. Please share my Vedios with your friends..

[@sarnab1956]

sir I have one confusion u said for Rec - tm either rejects or accepts my doubt is language accepted by tm only is recursive or both accepted + rejected by tm belong to recursive language

[@THEGATEHUB]

recursive language: Turing machine accepts every string in language L and rejects all strings that don't match the strings of L.

[@sarnab1956]

@@THEGATEHUB sir if a language is accepted by tuning machine it's recursive,if it's rejected ( halts on non final state) its recursive or non recursive

[@sarnab1956]

@@THEGATEHUB matlab agar tuning machine language ko accept kar raha hai tabhi language recursive hai warna non recursive Ya tuning machine language accept kar raha hai final state me jake + reject yani halt kar raha hai non final state me dono case me language recursive hai Sirf agar loop me Jata hai tab non resursive hai

[@THEGATEHUB]

@@sarnab1956 If L is a recursive language then − If w ∈ L then a TM halts in a final state, If w ∉ L then TM halts in a non-final state.

[@THEGATEHUB]

@@sarnab1956 yes..now it's clear ..for further communication you can contact me at Instagram..insta I'd is in channel about section.

[@sarnab1956]

sir agar language accept ho raha hai tm se sirf tabhi language recursive hai ya looping chorke accept ya reject koi bhi ho dono case me hi language recursive hai

[@knowhereeverythingchannel]

maza aa gaya

[@ashutoshpani3223]

🙏🙏