I’m not sure how to answer problem 4. Can someone help me withthis. thanks
Answer
4.
a. If is Turingcomputable then this means there exist a TM M which on input w,will output 1 if
and output0 otherwise.
If TM M exists to compute function , thenusing TM M, we can decide whether any input w belongs to L or notby checking whether
If
thenaccept w since
and if
OR
OR