USING RICE’S THEOREM IS NOTALLOWED. Please explain so I can study the solution and learn fromit
In this question, all Turing Machines will have tape alphabet {0,1, -^. Consider the function BB N-N where for all k, BB(k) is the maximum number of time steps that any Turing Machine M with k states takes on the blank tape before it halts. Formally, BB(k) t if and only if t is the smallest integer such that
OR
OR