The language of Turing machines that accept exactly $k$ inputs
Hint: to decide whether $M$&nbsp;halts on input&nbsp;$w$, consider a new machine&nbsp;$M'$ that rejects every input except&nbsp;$w$ and simulates&nbsp;$M$, otherwise. That's not quite the answer but it should get you close enough.