Most real numbers between 0 and 1 cannot be calculated, named, or written down. They exist mathematically — they fit the axioms perfectly — but no algorithm, no program, and no formula will ever produce them. And there are vastly more of these uncomputable numbers than the kind we use every day.

This result comes from computability theory, founded by Alan Turing and Alonzo Church in the 1930s.

A computable number is any real number that some finite algorithm can output to arbitrary precision. The square root of 2 is computable — there's a clear procedure. Pi is computable. So is Euler's number e. Every number a person could ever encounter in school, science, or engineering is computable.

The set of all computable numbers is countable. The reasoning is direct: each computable number corresponds to at least one algorithm, algorithms are programs, and programs are finite strings of symbols drawn from a finite alphabet. There are only countably many finite strings — the same countable infinity as the natural numbers.

But the real numbers themselves are uncountable, as Georg Cantor proved with his diagonal argument in 1891. There are strictly more reals than integers — a larger infinity.

Subtract the countable computable numbers from the uncountable reals, and what remains is also uncountable. In the strict mathematical sense, almost every real number has no algorithm that computes it. No program can produce its decimal expansion. No formula generates it. No name can specify it.

These numbers are entirely consistent. They simply cannot be reached. The vast majority of mathematics is hidden behind a wall that no computation can ever cross.