Comment by za_creature

Yeah, I call bs.

We have had good evidence that the choice of pivot doesn't generally invalidate the nlogn complexity of quicksort.

Except for when it does.

And then we do the work and prove an average of nlogn with a random pivot choice.

Then we know that quicksort is safe to use.

So no, I or anyone else don't need to demonstrate that the non-deterministic outcomes of inference are sometimes invalid. It's the other way around, always has been and always should be. This is "leaded gasoline is safe" mixed with "smoking is not addictive" propaganda.