Explain why the following is not a description of a legitimate Turing machine.
$M_{bad} = “$ On input $\langle p \rangle,$ a polynomial over variables $x_{1},\dots,x_{k}:$
- Try all possible settings of $x_{1},\dots, x_{k}$ to integer values.
- Evaluate $p$ on all of these settings.
- If any of these settings evaluates to $0$, accept; otherwise, reject.$”$