The set of turing machine that stops with input zero is not recursive
Hint: if you want to know whether $M$ accepts $w$, build a machine that replaces its input with $w$ and then does whatever $M$ does.