0 votes 0 votes Show that the problem of determining whether a Turing machine halts on any input is undecidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 14, 2019 • retagged Mar 15, 2019 by Rishi yadav Rishi yadav 138 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.