M Sure Answer Problem 4 Someone Help Thanks Q37186466

I’m not sure how to answer problem 4. Can someone help me withthis. thanks


Answer


4.

a. If XL is Turingcomputable then this means there exist a TM M which on input w,will output 1 if w EL and output0 otherwise.

If TM M exists to compute function XL, thenusing TM M, we can decide whether any input w belongs to L or notby checking whether M(w)-1 or 0 If M(w) = 1 thenaccept w since w EL and ifM(w) 0

OR
OR

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.