This question already has an answer here:

$<M>$ is the encoding of a TM and L(M) is the language accepted.


marked as duplicate by Yuval Filmus turing-machines Dec 18 '18 at 23:25

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • $\begingroup$ When you wrote $L(M)\; is\; finite\; set$ - do you mean it it's have finite amount of words? I.e. the is a number $n$ of acceptable words? $\endgroup$ – Yoar Dec 18 '18 at 21:12
  • 1
    $\begingroup$ Yes, that is what I mean $\endgroup$ – sharprabbitz Dec 18 '18 at 21:14