raluk

6 ms·

31.
by raluk 2y ago
Extra. I am not sure if that is clear from paper, but in example of 1.75 * 2.5 we can represent 1.75 also as (1-0.125) * 2. This gives good aproximations for numbers that are close but less than power of 2. This way abs(a*b) in (1+a)*(1+b)
32.
by raluk 2y ago
Your kernel seems to be incorrect for 1.75 * 2.5. From paper we have 1.75 == (1+0.75)*2^0 for 2.5 == (1+0.25)*2^1 so result is (1+0.75+0.25+2^-4)*2^1 == 4.125 (correct result is 4.375)
33.
by raluk 2y ago
RAII
34.
by raluk 2y ago
> California will not abandon its responsibility.
35.
by raluk 2y ago
What I came up with is interval arithemtic. Point is that operations of intervals are lazy (there are two main opeations over set of intervals, union and intersection). When doing one of this two operations, you just provide another view ov
36.
by raluk 2y ago
In readme, they should write tutorial on how to make money with this. I mean is there any other reson for using this software?
37.
by raluk 2y ago
Simplest explation is: If you take a closer look to Shannon–Hartley theorem https://en.wikipedia.org/wiki/Shannon%E2%80%93Hartley_theore... you can see, that in theory you can have arbitrarly low signal/nose ratio
38.
by raluk 4y ago
Here in haskell: https://www.microsoft.com/en-us/research/wp-content/uploads/... Functional programming is not about "no side effects", but how to separate pure functions and side effects. Addi
39.
by raluk 4y ago
Here is another version of similar idea as oneliner. Additional feature - no loops and no conditions. fb = lambda n : n == 0 or not fb(n-1) or not print(['{}',"fizz","buzz","fizzbuzz"][((n%3)==0