Comment by kevinwang

> There's literally no such thing as a hard wall where something is nlogn in time and can't get lower.

Isn't this an ironic example to use, since one of the only lower bounds we have actually found is nlogn for comparison-based sorting?

And anyways, this point seems too strong: the fact that TCS people believe NP != P is another example that we believe a lower bound exists, no? (And relatedly, the large portion of TCS that is dedicated to trying to figure out how to lower-bound anything, while admittedly not so successful yet, shows that researchers believe lower bounds exist. I mean, any complexity class non-equality hypothesis is an example of this, no?)