176 views
0 votes
0 votes
If M is turing Machine Then what is L(M) denoting here??

1) is it denoting Language generated by turing machine

or

2) encoding of turing machine(in 0's and 1's) as a language?

1 Answer

0 votes
0 votes

$L(M)$ is used to denote the language that is recognised by the Turing Machine.

For an encoding, the general notation used is $<M>$.

The encoding of a TM, is a string that encompasses all the information of the 7-tuple describing $M$. You can think of it as "writing the 7-tuple as a binary string" (but this is a simplification). So the encoding of $M$, is just a string that describes how the TM works.

Related questions

3 votes
3 votes
1 answer
1
3 votes
3 votes
2 answers
2
3 votes
3 votes
2 answers
3
0 votes
0 votes
0 answers
4
Lone Wolf asked Aug 7, 2018
208 views
is it true that:-1) turing decidable languages are recursive languages.2) turing recognizable languages are recursive enumerable.