## Is \$nHALT\$ undecidable even if \$M\$ halts on input \$w\$ in finite steps

If we have the language

$$nHALT=\{;$$ $$M$$ halts on input $$w$$ in less than $$n$$ steps$$\}$$

Is this language also undecidable in the same way that $$HALT$$ is undecidable? And if so, $$nHALT\notin P$$, right?