(Solved) : 1 Let L Language Consists Strings Mi M2 K Mi M2 Two Turing Machines K Positive Integer L M Q33249770 . . .
1. Let L be the language that consists of strings (Mi, M2, k), where Mi and M2 are two Turing machines and k is a positive integer such that |L(Mi)U L(M2)l 2 k. a) Prove that L is Turing-recognizable. b) Prove that L is not Turing-decidable. Show transcribed image text
Expert Answer
Answer to 1 Let L Language Consists Strings Mi M2 K Mi M2 Two Turing Machines K Positive Integer L M Q33249770 . . .
OR