The language $\{w \mid w \in \{0,1\}^{*}\text{ and }M_w\text{ accepts infinitely many inputs}\}$ is undecidable, where $M_w$ is the Turing machine represented by $w$.
I am confused because I do not know how to reduce this problem. Maybe it works with the complement of the Halting problem?