Question

Theory of computing problem Hello! I'm stuck here, any help will be greatly appreciated! If the...

Theory of computing problem

Hello! I'm stuck here, any help will be greatly appreciated!

If the language you have is recursive

     then your TM acceptor is    ___________________ but

     If the language you have is recursively enumerable

     then your TM acceptor is    ___________________

0 0
Add a comment Improve this question Transcribed image text
Answer #1

If the language you have is recursive, then your TM acceptor is decidable but
If the language you have is recursively enumerable then your TM acceptor is recognizable/semi-decidable
Add a comment
Know the answer?
Add Answer to:
Theory of computing problem Hello! I'm stuck here, any help will be greatly appreciated! If the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT