Question

3. Let T = {< M > | m accepts w when it accepts w. }. Show T is undecidable.

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

This can be easily proved using Rice's Theorem.

Rice's theorem states that any non-trivial property of a Turing Machine is undecidable.

A non trivial property is a property is not possesed by all Turing Machines

Because not all Turing Machines can accept their reverse, so it is undecidable

Add a comment
Know the answer?
Add Answer to:
3. Let T = {< M > | m accepts w" when it accepts w. }....
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