uncountable set
An uncountable set is an infinite set that is too big to be listed — there is no way to enumerate its elements as a sequence indexed by the natural numbers, because any proposed list necessarily misses something. Uncountability is the discovery that infinity comes in different sizes: beyond the countable infinity of N, Z, and Q lies a strictly larger infinity, and the prime example is the set of real numbers.
Formally, a set is uncountable if it is infinite but admits no bijection with any subset of N — equivalently, no surjection from N onto it. The benchmark theorem, due to Cantor, is that the interval (0, 1), and hence all of R, is uncountable. Its cardinality is called the cardinality of the continuum, strictly greater than that of the naturals.
Uncountability has bite in analysis. Because Q is countable but R is uncountable, “most” real numbers are irrational; indeed the irrationals are uncountable while the rationals form a set of measure zero. The same size gap explains why one cannot integrate by simply summing over points and why measure theory, rather than naive counting, is needed to handle the continuum. Cantor's theorem goes further: the power set of any set is strictly larger than the set, producing an infinite tower of ever-greater infinities.
The set of all infinite binary strings (sequences of 0s and 1s) is uncountable, by the same diagonal trick as for the reals: given any list of strings, flip the n-th bit of the n-th string to build a string on nobody's row.
Binary strings: a clean setting for the diagonal argument.