anderskaseorg

29 ms·

271.
by anderskaseorg 7y ago
10^0.3 ≈ 1.995 is close to 2. Reordering the first ten powers of 10^0.3 and taking out whole powers of 10 gives you exactly the first ten powers of 10^0.1.
272.
by anderskaseorg 7y ago
The non-antialiased “case” is one spot among the continuum of antialiased “cases”; it doesn’t satisfy totally different perceptual rules. What gamma curve would you propose to correct for the perceptual equality of a 9.3px white-on-black l
273.
by anderskaseorg 7y ago
> * What gamma curve yields the perception of equal width of black-on-white and white-on-black thin lines (also relevant for text)? (Hint: likely not linear luminance) Gamma curves do not affect black and white themselves, only intermedi
274.
by anderskaseorg 7y ago
That’s…what HTML escaping is for…?
275.
by anderskaseorg 7y ago
I’m pretty sure you lost track of your own analogy there. If there are better deals at a different supermarket, people will just go there. They might even go to multiple supermarkets in pursuit of deals. Literal death is not a realistic
276.
by anderskaseorg 7y ago
https://shells.aachen.ccc.de/~spq/md5.gif https://news.ycombinator.com/item?id=13823704
277.
by anderskaseorg 7y ago
RCV is better than FPTP, but it still mathematically converges on a two party system. https://www.youtube.com/watch?v=7Q7rzqJ0YS8 https://rangevoting.org/Duverger.html There are better single-winner syste
278.
by anderskaseorg 7y ago
If you actually work through the game theory, you find that single-winner instant-runoff voting is nearly as vulnerable to Duverger’s Law of two-party domination as plurality voting. https://www.electionscience.org/voting-me
279.
by anderskaseorg 7y ago
The single-winner form of ranked choice voting (a.k.a. instant runoff voting) doesn’t help third parties as much as you think! It makes it safe for you to give your first choice to a third party candidate who has no chance of winning, becau
280.
by anderskaseorg 7y ago
I'm guessing that is deliberate: the article text can be generated from a human-written author and headline.
281.
by anderskaseorg 7y ago
“Everyone should switch to (in order of preference): • BLAKE2b / BLAKE2s • SHA-512/256 • …” You know, SHA-512/256 was a terrible name. For someone who’s not a cryptographer, it’s way too easy to confuse the single algo
282.
by anderskaseorg 7y ago
Yes, as of a couple of days ago in nightly (pre-1.36): https://github.com/rust-lang/rust/pull/58623
283.
by anderskaseorg 7y ago
Meh. A plain square grid has a speed range of 1.414 to 1 (because of the diagonal approximation error); a plain hexagonal grid has a speed range of 1.155 to 1 (because of the “drunken hexagon walk” at 30° angles); and a square grid with th
284.
by anderskaseorg 8y ago
Note that this delegates all protocol parsing to the hiredis C library. Using C libraries is not an invalid way to write Python, of course, but it may limit the generalizability of the purported lesson.
285.
by anderskaseorg 8y ago
“No variable shadowing” might sound great when you’re thinking about that one time someone confused you for three seconds with the addition of a new inner variable with the same name as an outer variable. But once you realize that it equal
286.
by anderskaseorg 8y ago
Please don't! This will wear out both the battery and the flash memory for no reason. It's exactly this kind of sloppy coding that made these manufacturers decide app killers were necessary.
287.
by anderskaseorg 8y ago
From 2013. The current record is 22.4 trillion digits from 2016: https://pi2e.ch/blog/2016/11/11/hitting-the-target/
288.
by anderskaseorg 8y ago
Self-driving cars use cameras too!
289.
by anderskaseorg 8y ago
A network effect _is_ a kind of monopoly, and this monopoly power can be abused like any other. It’s harder to compete with Facebook than it would be in an idealized free market because there are only so many different platforms a user wil
290.
by anderskaseorg 8y ago
Implementing your own kernel is awesome, but also makes it sort of definitionally not a Linux kernel…
291.
by anderskaseorg 8y ago
See also rsplit(':', 1). But instead of either of those, you should really be using library functions that already understand the format in question instead of making up your own rules. >>> u = urllib.parse.ParseResu
292.
by anderskaseorg 8y ago
(2010)
293.
by anderskaseorg 8y ago
I reported this four years ago with a patch at https://trac.nginx.org/nginx/ticket/642 . Nobody seems to have noticed.
294.
by anderskaseorg 8y ago
The Turing machine proof does yield an explicit unprovable statement when you combine it with the (constructive) proof of the undecidability of the Halting problem. Let H be the Turing machine that, when given a Turing machine M, searches
295.
by anderskaseorg 8y ago
It remains disturbing to read that something needs to be privileged just so it can sandbox unprivileged code. Why should I have to choose between trusting the sandbox and trusting the code that runs inside it? Why do we keep collectively
296.
by anderskaseorg 8y ago
A Ford–Johnson merge-insertion sort would need 28% fewer comparisons on average than the quick sort used here. https://en.wikipedia.org/wiki/Merge-insertion_sort
297.
by anderskaseorg 8y ago
After we have a formal understanding of exactly which invariants unsafe Rust code may rely on and must preserve, we may be able to integrate a proof assistant into Rust to allow all that functionality and more to be exposed safely—we could
298.
by anderskaseorg 8y ago
Your proposed statement “conforming implementations cannot transform code on the basis that some behavior left undefined by the standard is impossible” would have no meaning in the standard, even if it were written somewhere other than a no
299.
by anderskaseorg 8y ago
I used range(row * (row - 1) // 2 * n + col, row * (row + 1) // 2 * n + col, row) in Python. For n = 14, row = 13, col = 3, this is [1095, 1108, 1121, 1134, 1147, 1160, 1173, 1186, 1199, 1212, 1225, 1238, 1251, 1264] no
300.
by anderskaseorg 8y ago
No, it still fails for even n; see my other comment: https://news.ycombinator.com/item?id=17104624

More ›