Homework Help Question & Answers

Is it true that every recursively enumerable language is recursive, and is it true that every...

Is it true that every recursively enumerable language is recursive, and is it true that every language is recursively enumerable?

0 0
Add a comment
Answer #1

Answer)
When the language is recursive, there will exist the Turing machine which can accept or reject the language. The recursive languages will be the subset of recursively enumerable, thus the Turing recognizable means that the language is also recursively enumerable. Thus it is true that the recursively enumerable language or the recursive languages are always recursively enumerable.

**Please Hit Like if you appreciate my answer. For further doubts on the or answer please drop a comment, I'll be happy to help. Thanks for posting.**

Add a comment
Know the answer?
Add Answer to:
Is it true that every recursively enumerable language is recursive, and is it true that every...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coin

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