News for hackers. Stuff that matters.
Re:Bhartrhari's Paradox by gaoshan on Friday August 28, 2026 @10:25AM (#49478969)
If you can't name it you can still describe it.

But then by describing it you are committing it to a set of conditions this unnameable thing satisfies.

But then if you go beyond a narrow interpretation of that paradox and accept that naming and describing are both accomplishing the same fundamental thing, that being committing a thing to a condition (like a name) or set of conditions (like a description), you do run into the same problem.

Hmm, interesting. Now back to this E2E testing stuff I've been avoiding.

Re:Bhartrhari's Paradox by LanceH on Friday August 28, 2026 @11:41AM (#49480197)
In mathematics, there are infinitely many "computable" numbers. That is, numbers which can be describe using any mathematics available. Then there are far more "non computable" numbers, which can't be described by anything finite.

I think there is some analogy to be made here.

Re:Bhartrhari's Paradox by bwfan123 on Friday August 28, 2026 @10:38AM (#49479204)
Names are like variables in a function. you can name variables anything you want from a human understanding point of view (final cause), but the compiler doesnt care about that. The compiler only cares about the efficient cause of that variable in the sense of what it represents (stack/heap etc).