Recent submissions

Comment · 6 years ago
This is really cool. Have you looked at all at the constant Q transform https://en.m.wikipedia.org/wiki/Constant-Q_transform which is basically a Fourier Transform with logarithmically spaces bins so that it can be aligned with traditional musical notes. Miller Puckette (Max/Pure Data) among others, has a fast algorithm for its calculation.
Comment · 6 years ago
Comment · 6 years ago
Yeah I think this terminology is odd because I think that the computable numbers are much more “useful” than the definable numbers.
Comment · 6 years ago
For an alternate empirical take:

https://weis2019.econinfosec.org/wp-content/uploads/sites/6/...

They find publishers only have a 4% premium on programatic ads that involve behavioral targeting.

Comment · 6 years ago
The test they use to select employees correlates with their rating of employees is pretty circular. Any arbitrary test will do that.
Comment · 6 years ago
I haven’t read this in detail, but a few things stand out. In the write up, you say it compares better than bitwise radix sort. You need to compare against an optimized byte-wise radix sort which is by far the fastest sort for decent sized arrays of integers. The second claim that skyline sort somehow sorts an array of size a faster than two arrays of size n does not make sense. That implies that the time per element goes to zero as the size goes to infinity. That would be faster than O(n), which is what radix sort is, i.e. constant time per element for larger arrays.

It sounds like this is just a variation of counting sort or bucket sort optimized for a small number of unique values.

Comment · 6 years ago
Somewhat, in that it doesn’t use more precision than needed, but the real issue is you can’t just pick some arbitrarily large precision and round at the end. For some calculations, even 400 digits during intermediate steps would not be enough due to catastrophic cancellation and you would need to go even higher precision to get the right answer. It really is about solving an accuracy issue and not an optimization. And determining that you are using sufficient precision to get an accurate answer is an extra cost, so it is always more expensive than just plowing ahead and calculating an inaccurate answer.
Comment · 6 years ago
The default Android calculator app by Hans Boehm (developer of the Boehm Garbage Collector as well) does this by using the computable real numbers.

https://dl.acm.org/doi/10.1145/2911981

Provides a good overview of how it works and perms website has more information.

What’s cool about the computable reals implementation is you can increase the precision after the fact and it will recalculate up to that precision. Basically it memoizes the steps of the calculation and how they affect the precision.

Comment · 6 years ago
Comment · 6 years ago
I would also like to not that encoding the the Option<char> using the unused bits of the return value is a perfectly valid implementation. But that is exactly what it is, an implementation detail. It could work exactly the same way as today but the programmer wouldn’t have to care about how it was implemented, just whether they got a char or None.
Comment · 6 years ago
http://c-faq.com/decl/spiral.anderson.html Is the rule I learned to understand C declarations and while the rule there is described as simple I think the examples even without argument types are actually fairly complex.

It also seems telling that no recent language has followed C’s example for declaration style, which is more implicit than explicit.

Comment · 6 years ago
Actually this is quite a bit different. This is more a columnar-store version of SQLite, basically an embedded OLAP database, which is pretty cool. I’m not aware of other column-stores in this niche, most are distributed systems meant for big data and so are much more complicated to setup and manage.
Comment · 6 years ago
Smoke C by several orders of magnitude? Citation needed.
Comment · 6 years ago
https://en.m.wikipedia.org/wiki/Blackbird_(land_yacht) Was built to demonstrate that you can sail directly downwind faster than the wind as well.
Comment · 6 years ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton