How can I construct a Turing Machine that accepts the language L = <'M'> which is an encoding of a Turing Machine M?
closed as unclear what you're asking by Luke Mathieson, D.W.♦, David Richerby, Juho, Rick Decker Dec 13 '14 at 19:18
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
Choose a coding of Turing machines such that every string is a valid coding. Then, your Turing machine just needs to accept $\Sigma^*$, which is trivial.