# no-input Turing Machine which accepts in k or fewer steps

Can we prove by induction that $$A_k$$ is computable for every choice of $$k \in \mathbb{N}$$?

$$A_k$$ is the set of descriptions of a no-input Turing Machine which accepts in $$k$$ or fewer steps.

• – D.W.
Nov 4 '21 at 5:13

Well, just simulate $$M$$ for $$k$$ steps and see if it accepts or not