0 0 votes Let $L$ be the language consisting of pairs of $TM$ codes plus an integer, $(M_{1},M_{2},k)$, such that $L(M_{1})\cap L(M_{2})$ contains at least $k$ strings. Show that $L$ is $RE$, but recursive. Theory of Computation ullman theory-of-computation turing-machine recursive-and-recursively-enumerable-languages descriptive + – admin 326 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
