My mend does not believe the fact that A_TM is undecidable because he says that

Question

My mend does not believe the fact that A_TM is undecidable because he says that he can tell whether his program is in an loop on a given input Suppose that my trend has a specific program M and a specific input w. He defines the language L = {0} it M hats on input w and L = (1) it M goes into an infinite loop on input W. Then L is underlinable because A_TM is undecidable. underlinable Because it M goes rot an infinite loop we can never be sure that it is in one Decidable because my friend says so Decidable because L is regular Perhaps educable and perhaps undecidable, depending on what M and w are Anaconda corporation has announced a new product that, when given a Python program P as input, can determine whether P can go into an infinite loop on any input. Which of the following is true? Anaconda Corporation is scamming me because they are snakes Their product might work because it only handles Python program. Their product might work it it has a library or every possible Python program Their product does not work because Turing machines can be converted to python programs Their product does not work because Python programs can be convened to Tung machines

Explanation / Answer

1) Answer: option 2

Undecidable because if M goes to an infinite loop we can never be sure that it is in one

2) Answer : option 4

The product does not work because the Turing machine can be converted to python programs

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.