Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
suryaprakash
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by suryaprakash
0
votes
2
answers
1
TURING MACHINE
is every SEMI DECIDABLE an RE but not RECURSIVE?? plz help me with this.
is every SEMI DECIDABLE an RE but not RECURSIVE??plz help me with this.
1.3k
views
asked
Jun 2, 2018
0
votes
2
answers
2
TURING MACHINE
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but not RECUSIVE and NOT RECURSIVELY ENUMARABLE??????/ PLZ help me out with this
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but not RECUSIVEand NOT RECURSIVELY ENUMARABLE??????/PLZ help me out with this
343
views
asked
Jun 1, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register