dooglius

16 ms·

271.
by dooglius 2y ago
This looks like a case of erroneously inferring causation from correlation. If there is variance in the degree to which people are impeded by factors outside their control, then all that is required to observe such an association is that pe
272.
by dooglius 2y ago
The optimization is still valid under -fwrapv semantics. To see this, observe the invariant (0 <= i && i < count) when entering the loop body, and (i==0 || (0 < i && i <= count)) when doing the loop test -- in pa
273.
by dooglius 2y ago
As mentioned in the linked post, the compiler could in fact prove the increment on i wont overflow, and in my testing, -fwrapv does produce identical assembly (YMMV). The post talks about hypothetical more complex cases where the compiler w
274.
by dooglius 2y ago
I don't necessarily disagree (I am not a lawyer), my point is that reading an AGPL license at the bottom of the page can only be a good thing; it can only give you the ability to do more things than you could if had no notice been the
275.
by dooglius 2y ago
Unless otherwise specified, you have no license to use any code you find on the Internet.
276.
by dooglius 2y ago
I did; thank you for the correction.
277.
by dooglius 2y ago
Speaking for myself, I am impressed by something that is necessarily complex in order to accomplish some difficult task, and dislike needless complexity that could be simpler. A good example of necessary complexity would be this post from y
278.
by dooglius 2y ago
Does this work with multiple processors? It seems like you would have trouble if processor 1 calls cpuid but processor 2 does not for a long time, your emulation of proc 2 would need to be precise to a much-higher-than normal degree to be c
279.
by dooglius 2y ago
> After working with the system experts to build this control structure, we immediately noticed missing feedback from controller C to controller B–in other words, controller B did not have enough information to support the decisions it n
280.
by dooglius 2y ago
What exactly is the benefit over Waterfox or Ungoogled Chromium here? The FAQ https://kagi.com/orion/faq.html#firefox seems to be things that are specific to Mac or have privacy features already offered by open-source
281.
by dooglius 2y ago
You also have to trust where you get a non-onion link from?
282.
by dooglius 2y ago
How exactly would an HN client, in which one would presumably be able to view any linked page, differ from a general purpose browser?
283.
by dooglius 2y ago
Pretty much any standard notion of time complexity requires one to assume a random access machine, or else e.g. an array access is O(index) time.
284.
by dooglius 2y ago
Often for problems taking integer input x, formal CS will define the input to be something like 1^x (the character '1' repeated x times, as opposed to binary) so that the time complexity is in terms of x. This class of problems se
285.
by dooglius 2y ago
It sounds like you've just found one for >=2: 2, S(2), S(S(2)), ...
286.
by dooglius 2y ago
__builtin_thread_pointer() is the non-x86-specific way to get the appropriate register
287.
by dooglius 2y ago
Can you elaborate on the failure mode described here? If we take a model where registers (including PC) or memory can get bit-flipped, it seems like all bets are off.
288.
by dooglius 2y ago
Title should indicate that this is a _criticism_ of the rules.
289.
by dooglius 2y ago
It looks like they detected a muon and are inferring a neutrino from the fact it went through a lot of solid. Couldn't it be any other weakly-interacting particle though?
290.
by dooglius 2y ago
It looks like the result only matters in the case where the hash table is close to full. But couldn't one just deal with this case by making the table size 10% bigger? (Or, if it is resizeable, resizing earlier)
291.
by dooglius 2y ago
Do you have details? What prompts and what models?
292.
by dooglius 2y ago
If you offered minimum wage, do you think those candidates would still accept? If not, then you can deduce that the compensation must be a significant factor, but one that goes unstated.
293.
by dooglius 2y ago
It doesn't seem plausible to me that "why did you apply" is like an idiomatic expression. Where would it come up outside of a job interview? Are you saying that a non-autist would not get it in the first couple interviews as
294.
by dooglius 2y ago
I mean it pretty loosely, I'm just trying to figure out what Mazur meant. The quote and reference to a cutoff seems to imply that solveability preserves some kind of structural partial order between Z and C, but it's not clear to
295.
by dooglius 2y ago
> Where is the cutoff Is there a reason to believe there is a "cutoff"? As in, do we know that if the undecidability property holds for some ring A, then it holds for every subring of A?
296.
by dooglius 2y ago
Doesn't this give enough detail for someone to replicate easily? I'd think it would not be too hard to look at the signature and find the insecure function used.
297.
by dooglius 2y ago
Intel's theory I believe was that it could become the only source. The argument in favor I think is the same one you are making now: anything that could hack the chip deeply enough to break rdrand is powerful enough to achieve the same
298.
by dooglius 2y ago
No, GDB has a pretty good Python extension framework
299.
by dooglius 2y ago
Can do this with Qubes OS by running in a non-networked qube
300.
by dooglius 2y ago
Ruhr University Bochum, the third author's University

More ›