0 votes 0 votes $\text{Theorem}:$ Let $M$ be any Turing machine. Then the question of whether or not $L(M)$ is finite is undecidable. Show in detail how the machine $\widehat{M}$ in $\text{Theorem}$ is constructed. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 16, 2019 Rishi yadav 171 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.