This is just one of those quirks of human language. Yes it's occasionally annoying similar things have very disparate meanings, but English in particular is never going to shake them off.
Well, it is. It means several things (but not what the parent guessed).
Among those:
- something having been proofread
- a yeast having been activated
- made something waterproof
And if it were I’d certainly assume it was a reviewing / publishing concept related to proof copies and proofreading (as in, a proofed copy would have gone through proofreading and no error would’ve been found).
Not related to the logical concept.
Well it is, but it has to with a baking technique rather than anything mathematical.
The difference is the two kinds of proving, one of which is vanishing from the language: the sense of testing something, practically, rather than by reason or evidence. A proof copy is when a type plate is prooved, the rising of dough prooves the culture's activity.
So these irregular noun-to-verb forms exist because proof has largely lost the second meaning.
It’s pretty normal to use “proved” in place of “observed” or “measured” in day-to-day speech though. Usually a few repeatable measurements are enough proof (evidence) for most people to consider something “proven”.
Edit: I forgot the proofread meaning pointed out by the sibling comment.
Otherwise I agree, as a native english speaker I’m not familiar with it being used in engineering/mathematics contexts.
Scientists. Scientists find issue with that sentence. People who care about scientific integrity within the computer science field.
HN is largely software engineering practitioners. Practice is one level of complexity above the mathematics; among the mathematically optimal solutions to a problem, you have to find the one that's actually fastest on some sort of computer you can buy. Otherwise the math is just an interesting fact to throw out at parties. Testing in the real world is really the only way to find the solution that is fastest in the real world, but of course, mathematics dramatically limits the search space for the ideal algorithm.
Basically, farmers aren't interested in how much milk a spherical cow can produce. There are no spherical cows.
First of all: Theoretical results are actually quite important for real-life performance. It’s possible to write an implementation of bubble sort, have a bunch of benchmarks which shows great performance and 100% test coverage. Yet there are cases where you’ll hit the n^2. The theoretical proof (especially the worst case) are quite important to not get bitten by this. You can search for “accidental quadratic” for plenty of cases where this happens in practice: people have implemented algorithms which works well in practice for small n, but fails (unnecessary) for larger n. A theoretical analysis would have caught this (although probably not worth the engineering effort).
Secondly: “proving” isn’t exclusive to theoretical analysis. I’d argue you can “prove” that a method call in Ruby is slower than a function call in C. You can look at the machine code which gets executed and see that there’s no way for a CPU (regardless of cache, pipelining etc) to execute the Ruby variant faster. There will of course be plenty of assumptions (as there is in theoretical proofs as well!), but in my option it’s a proof nonetheless.
However, to claim that “Kermem is provably 10x faster than FlatBuffers”, I’d say that you need more than a few benchmarks. You’d have to argue that every operational is (at worst) 10x faster.
You've also completely misrepresented my point. It's not a "no true Scotsman" fallacy, at all. Not sure what spherical cows have anything to do with anything.
Proof is a fact, argument, or *piece of evidence* which shows that something is definitely true or definitely exists.
That demonstration is a piece of evidence that shows that an algorithm is truly faster on that computer with that specific input, sure it's not a formal generalizable CS proof but it a valid usage of the word proven nonetheless.In the context of computer science, it is not proven.
No, you have the hypothesis X is faster than Y, and some evidence to back it up. It's no different than a scientist treating cancer cells with unobtainium, and claiming it "proves unobtanium cures cancer".
You need a lot more rigor to prove benchmarks. Notably absent is some independent verification and peer review. It's possible to write benchmarks in ways that bias the outcome.
If you have multiple different benchmarks written by independent authors and counter-reviewed, all showing 10x speedup, sure, call it "proven". A few benchmarks on 3 arches, no, use the word "shown" or similar.
By coincidence I just wrote a proprietary serialization format a few months ago for work, and it's proven to be 42x better than flat-buffers, depth-buffers, proto-buffers and even the equivalent electro-buffers. Unless you care about average space efficiency, then it's worse probably!
Was that intentional? If so, well done!
> proven
> adjective
> demonstrated by evidence or argument to be true or existing.
Looked for some random news article and found "Trump has proven himself unworthy to be this country’s chief executive again", "India's Toy Sector Proven Its Mettle By Transforming Itself". None of these are wrong usage.Here's the search you got that from: https://www.google.com/search?q=proven+definition
And right underneath we see
> (of a new method, system, or treatment) tried and tested.
Which undermines your argument, so I can see why you left it out, but this was easy homework to check.
Nothing about this thread changes the meaning or adds value to anyone and only brings negativity to conversation. Do better.
I’d recommend not using the word “proven” here. In computer science this word typically refers to a mathematical proof. In this case it seems that you ran a regular benchmark for some schemas.
I’d also like to see more what the benchmark actually does. A typical trade-off of these formats is how much you do up-front vs on-demand. E.g. accessing fields after multiple variable-length field: Here it’s possible during “decoding” to make sure all fields can be accessed in O(1), or you can do nothing and then every time you access a field you compute the field location. Whether the benchmark accesses the field once or ten times will make a huge difference.
In general: If you’re just telling me that it’s 10 times faster without explaining why I will be skeptical.