Given is the modified definition of a TM where everything is equal except for one change: $\Gamma=\Sigma\cup \mathbb{N}\cup\{\square\}$

How do I prove that there is a TM $M$ for any language $L\subseteq\Sigma^*$ while $\Sigma=\{a,b\}$ and $\Sigma\cap\mathbb{N}=\emptyset$ so that $T(M)=L$?


1 Answer 1


First hint: construct a TM that converts the input into a unique natural number

Second hint: encode the language directly in the turing machine, by specifying which natural number is considered a part of the language and which one isn't.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.