Yrlec

19 ms·

181.
by Yrlec 17y ago
I haven't read the entire report but it looks really cool. If I understand it correctly it can automatically detect and fix bugs previously found in other software. Would be really cool if you would have a huge database of known bugs which
182.
A drug slows ageing in middle-aged mice(nature.com)
27 points by Yrlec 17y ago|16 comments
183.
by Yrlec 17y ago
The negative rate only applies for banks which store their money overnight at the Swedish Central bank (Riksbanken). The interest rate at peoples' bank accounts is stil positive. They do this to force the banks to lend the money they lend f
184.
by Yrlec 17y ago
I think you are mixing runtime scalability with the actual complexity. Big-O definition from Wikipedia: Let f(x) and g(x) be two functions defined on some subset of the real numbers. One writes f(x) = O(g(x)) as x -> infinity if and onl
185.
by Yrlec 17y ago
Restricting the size of w (and therefore also n) does not make it linear. Lets say you have restricted w to 32. Then you also know that n <= 2^32. If you now for instance are using mergesort then you also know that the number of recursi
186.
by Yrlec 17y ago
A word which is w bits long can hold a number between 0 and 2^w-1. If you want to hold a larger interval than that you need to increase the size of w. Perhaps you can make it smaller than log(n) for many use cases by restricting the type of
187.
by Yrlec 17y ago
Radix-sort is actually not linear. The algorithm will only work if the word-length w>=log(n) (because otherwise you can't store all possible n) so O(nw) is practically the same thing as O(nlog(n))