Q36

Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$

Given a Turing machine $\textit{M},$ decide if $\textit{L(M)}$ is regular.

Given a Turing machine $\textit{M},$ decide if $\textit{M}$ accepts all strings.

Given a Turing machine $\textit{M},$ decide if $\textit{M}$ takes more than $1073$ steps on every string.