16 Jun
2009
16 Jun
'09
8:03 p.m.
Am Mittwoch 17 Juni 2009 00:50:45 schrieb Richard O'Keefe:
One of the correspondents in that thread claims that it is provably impossible to have an efficient priority queue implementation without mutability.
If he so claims, maybe you can challenge him by asking for a proof?
He claims that the burden is on my end.
Certainly not. He claims X is provable, so he has to either provide a proof himself (a sketch may suffice), or tell you where you can find a proof. The burden of proof is always on the claimant.