Re:Which hashing algorithm is best for uniqueness and speed?
by abentspoon on Monday October 14, 2013 @11:16AM
(#6547697)
Interesting. I was going to complain, as I thought "probably" meant the probability of occurrence was greater than 50%.. That doesn't seem to be the case.
I would guess waynecochran thought something similar.
[ Parent
| on HN ]
Re:Which hashing algorithm is best for uniqueness and speed?
by ColinWright on Monday October 14, 2013 @11:36AM
(#6547829)
Curious. I've just taken a straw poll in the office. I asked "if someone said something was probably going to happen, what probability would you give it?"
The answers were:
* 80%
* 50% to 90%
* 90%
* > 80%
* 80%
* 80% to 90%
Re:Which hashing algorithm is best for uniqueness and speed?
by StavrosK on Monday October 14, 2013 @12:02PM
(#6547984)
My guess would have been "exactly strictly higher than 50%".
Re:Which hashing algorithm is best for uniqueness and speed?
by crpatino on Monday October 14, 2013 @12:51PM
(#6548297)
While mathematically correct, this does not seem to be how people use with that phrase. "X is probably going to happen" implies there is some evidence in favor of X, while "X is probably not going to happen" implies evidence against. Now, in regular speech, people do not feel compelled to force themselves to choose one or the other, but are just as likely to say "I have no idea", implying no evidence in either direction.
From an Information Theory point of view, 50% probability means zero information, and 25%/75% probabilities mean one bit of information against/in-favor-of the event. This sounds roughly consistent with the results of the poll, with people assigning higher probabilities implying higher information density of the evidence.
Re:Which hashing algorithm is best for uniqueness and speed?
by carbocation on Monday October 14, 2013 @12:32PM
(#6548171)
Same; "more probable than not", which falls back on your definition.