Re:Researchers achieve ‘absurdly fast’ algorithm for network...
by themonteray on Wednesday June 08, 2022 @10:26PM
(#31676971)
o(1) is "little O" notation, where for a function y = o(f), y(x) / f(x) --> 0 as x --> infinity. In other words, y goes to 0 faster than f. In this context, m^(1 + o(1)) means roughly that you converge to linear time for large m.
[ Parent
| on HN ]
Re:Researchers achieve ‘absurdly fast’ algorithm for network...
by account42 on Friday June 10, 2022 @08:10AM
(#31692938)
I wish we could all collectively agree that using = for the o/O/etc. notations is stupid and stop this. These are sets of functions. f is not equal to the set, it is an element of the set and we already have a well defined notation for that: f ∈ o(...). So use that or use the LateX f \in o(...) if you want to restrict yourself to ASCII. Using = only serves to confuse.
Re:Researchers achieve ‘absurdly fast’ algorithm for network...
by pvillano on Tuesday June 14, 2022 @05:55PM
(#31746540)
(some descriptive linguistics) People often think of "=" as "is", when "is" can convey both equality and possession of an attribute. IIRC there was an article about how American kids think "=" means "the answer is" because they first encountered it with equations like 5+5=10. I've also seen people write 2x+5=10 = 2.5, meaning "the answer to the problem 2x+5=10 is 2.5"