6 ms·

Loop Perforation (2019)

• tomcam 5y ago
  no
• touisteur 5y ago
  I think this is a very elaborate joke, though I was always surprised by some linear algebra algorithms that had a 'cooking recipe' feeling (looking at you svd) of 'loop enough time to get better results'...
• seg_lol 5y ago
  When your operations are statistical in nature, as Approximate Computing is, so then these operations themselves are different sampling methods. If the for loop is calculating a sum, but that value only needs to be over a threshold, there is no reason to add the whole thing, you need a proper sample size and distribution and that it what Loop Perforation is giving you in this case.
• dreamcompiler 5y ago
  The way you add the integers up to n is n(n+1)/2. Fixed that for you. No loops, and it's exact. Pick a better example.