The Berrys Paradox

Berry’s Paradox lives in the uncomfortable space between language and mathematics. A common form of the paradox asks us to consider: “The smallest positive integer that cannot be described in fewer than twenty words.” At first, this sounds like a valid description.

There must be many integers, and there are only finitely many sentences shorter than twenty words. So it seems reasonable that some integers cannot be described that briefly.

Then the problem appears. The sentence itself describes the number in fewer than twenty words. So we have just described a number that was defined as impossible to describe in that way. The contradiction comes from using natural language as if the idea of “describable” were perfectly precise. It is not.

What counts as a description? Which language are we using? Do two phrases that mean the same thing count separately? Can a description refer to another description? Questions like these show that ordinary language has hidden flexibility.

The paradox is associated with G. G. Berry and became known through Bertrand Russell in the early twentieth century.

I like Berry’s Paradox because it feels almost like a programming bug in language. The sentence creates a condition and then accidentally satisfies the condition it says cannot be satisfied. In formal mathematics and computer science, we often try to remove this kind of ambiguity by defining syntax and rules very carefully. Natural language is much harder to control. That is part of its beauty.

It is also part of its danger. Berry’s Paradox reminds us that words can look precise while quietly changing meaning under our feet.