Are there any known examples of sets that are definitely infinite, but where we don't know whether or not they're countable? I haven't heard of anything like this before, but it seems that there should be some example of a set like this.
As mentioned in the comments, it's possible to construct examples of the form
$$ S = \left\{ \begin{array}{ll} \mathbb{N} & \quad \mbox{if } P \mbox{ holds} \\ \mathbb{R} & \quad \mbox{otherwise} \end{array} \right. $$
where $P$ is some unresolved conjecture in mathematics. Certainly these sets work, but I was hoping for an example that arose "naturally" in the course of mathematics.
Thanks!
Here's a wonderful open problem in set theory, which can be translated to a statement which you might be looking for.
We can prove that under the assumption that $\aleph_\omega$ is a strong limit cardinal, it is necessarily the case that $2^{\aleph_\omega}<\aleph_{\omega_4}$. This is one of Shelah's most celebrated results from PCF theory. And we can arrange for every countable successor ordinal $\alpha>\omega$, that is the case that $2^{\aleph_\omega}=\aleph_\alpha$ (well, under certain additional assumptions anyway).
So we can rephrase the question as follows:
This set is always infinite, since every finite ordinal is necessarily in this set. But as the aforementioned problem shows, we do not know if it is always countable (even if we don't know exactly what is this set), or if it is possible for it to be uncountable.