We can explore a different face of the same issue.
The vague initial question is: How many subsets of the natural numbers are there ?
How me even understand this question depends on our background and our philosophy of mathematics. I have to present the following mostly in the usual language, whether I have issues with some terms or not.
I think most positions will grant that there “at least” a “countably infinite” number of subsets. We can simply consider the bijection f(n) = \{n\}. This is just us considering each positive integer as a singleton subset. Of course we have the even numbers, the odd numbers, the prime numbers also. So on top of these singleton sets we have many infinite sets.
Do we have uncountably many ? The standard answer is yes. Every (infinite) sequence that outputs bits encodes a subset.
If we understand the natural numbers to start at 1, then the even numbers are encoded as 0,1,0,1,0,1,…
This sets up the proof. Any list of such sequences can be diagonalized in basically the most aesthetically pleasing and prototypical way. Rudin offers this particular set of all sequences of bits as the first example of an uncountable set in his famous PMA.
OK then, so what’s the problem ?
The set of all computable characteristic functions — computable sequences of bits — is countable. This set includes all “Turing machines” and not only the “good” ones that pick out a subset of the natural numbers.
The “good Turing machines” are a subset of the countable set of all Turing machines. So there are at most a “countable infinity” of computable subsets of the natural numbers. There are also at least that many, because it’s easy to design the machines that characterize the singleton sets mentioned above.
Since the computable subsets of the natural numbers are countably infinite, “most” of the subsets of the natural numbers are not computable. In the standard approach, this “most” is very strong. Think of an ocean of darkness dotted by the tiniest little stars.
My philosophical/aesthetic issue is that an “uncomputable” subset is an undefined subset. If you can specify a subset objectively —without ambiguity — then it is computable. So all of these “uncomputable sets” are a vague blur or fume that comes out of linguistic reasoning.
One beautiful attempt to save the continuum without leaning on this blur was Brouwer’s “choice sequences.” Basically we can think of a sequence of bits as an always-in-progress sequences-in-progress of “free choices.” If we don’t have a rule, we just decide on the next bit whenever we feel like it, if ever. The sequence is becoming but never finally fully arrives. Functions on these in-progress-sequences are of course themselves such in-progress sequences. We can put an alphabetical order on them. In this context, the subset of the natural numbers is being created or determined “in time.”
Instead of shining a light on what is already there, we create by fiat, but without the full power of a god. We never “complete” our “infinite” sequence.