Question

Question 5 Is the following problem decidable: Given two Turing machines Mi and M2 and an input a, does Mi stop on z and M2 does not stop on a (gets to an infinite loop)?

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

As per your requirement the below one is solution please follow it

Solution 5: Given two turing machines M1 and M2 and an input x ,does M1 stop on x that means M1 halts on input x i.e.

Halt means input x accept or reject .Then machines M1 is undecidable and M2 does not stop on x that means machines M2 is hangs on input x. so machines M2 is undecidable .

Therefore the problem is undecidable .

Add a comment
Know the answer?
Add Answer to:
Question 5 Is the following problem decidable: Given two Turing machines Mi and M2 and an...
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