From the article: > Here’s another example (known as the Berry paradox): > Define {x} to be the smallest positive integer that cannot be defined in under {100

From the article: > Here’s another example (known as the Berry paradox): > Define {x} to be the smallest positive integer that cannot be defined in under {100} words. > This might look like a valid mathematical definition. But again it’s nonsensical. And, importantly for the sanity of mathematics, no analogous statement can be made mathematically formal. I thought it was worth mentioning that the Berry Paradox does show up in a mathematically formal way, and it was fascinating to me. It can be used to prove that a general algorithm to compute the Kolmogorov complexity of a string is uncomputable. https://en.wikipedia.org/wiki/Berry_paradox#Formal_analogues https://en.wikipedia.org/wiki/Berry_paradox#Formal_analogues