dooglius

12 ms·

181.
by dooglius 1y ago
The review is only a little shorter than the story!
182.
by dooglius 1y ago
Why do you believe it works? I don't particularly get the sense it has any effect whatsoever, particularly in cases where doctors are pressured to do harm. (There's also a lot of ambiguity left in what constitutes "harm"
183.
by dooglius 1y ago
For example?
184.
by dooglius 1y ago
Hamming distance doesn't strike me as a useful metric here because how "close" two rows are is entirely dependent on what the other rows are. E.g. if you have a row of all 1's then two rows with maximal hamming distance
185.
by dooglius 1y ago
The 'i' has more background: > The game is inspired by the synthesis of linear reversible circuits; a problem in reversible and quantum computation. Here, the goal is to construct a target operation, the target pattern in Swap
186.
by dooglius 1y ago
The mmap syscall operates on files so it's still very easily misinterpreted
187.
by dooglius 1y ago
I did read the entire article yeah, and I was rounding down with "271", but it wasn't clear to me what change you made that got you to the finish line. Are you saying that the next improvement was to force Gurobi to use integ
188.
by dooglius 1y ago
If you're saying that "non-determinism" is a term of art in the field of security, meaning something different than the ordinary meaning, I wasn't aware of that at least. Do you have a source? I searched for uses and fou
189.
by dooglius 1y ago
Non-determinism has nothing to do with security, you should use a different word if you want to talk about something else
190.
by dooglius 1y ago
What is/was Yamhill?
191.
by dooglius 1y ago
I'm confused, what did he change after the 271-move model to get it to produce the optimal solutions? It just says "With this improved model"...
192.
by dooglius 1y ago
I would always make the bad decisions (i.e. the ones that killed the character and ended the path) right away so that I wouldn't have to use as many fingers
193.
by dooglius 1y ago
̶F̶o̶r̶ ̶t̶h̶e̶ ̶s̶p̶a̶r̶s̶e̶-̶m̶a̶t̶r̶i̶x̶-̶m̶u̶l̶t̶i̶p̶l̶i̶c̶a̶t̶i̶o̶n̶ ̶e̶x̶a̶m̶p̶l̶e̶ ̶g̶i̶v̶e̶n̶,̶ ̶w̶o̶u̶l̶d̶n̶'̶t̶ ̶i̶t̶ ̶b̶e̶ ̶b̶e̶t̶t̶e̶r̶ ̶t̶o̶ ̶p̶r̶e̶-̶s̶o̶r̶t̶ ̶e̶a̶c̶h̶ ̶v̶e̶c̶t̶o̶r̶ ̶a̶n̶d̶ ̶d̶o̶ ̶n̶^̶2̶ ̶w̶a̶l̶k̶s̶ ̶o̶n̶
194.
by dooglius 1y ago
Do people not in tech go to tech conventions?
195.
by dooglius 1y ago
Does this mean they are deleting a bunch of code, or just that people will have to compile it manually? I'd imagine there is a lot of 32-bit specific code, but how much of that is 32-bit-Linux specific code?
196.
by dooglius 1y ago
> You need to join the contest in order to be allowed to submit. Doesn't seem to be publicly accessible to non-participants (yet?)
197.
by dooglius 1y ago
I'm totally in manual memory management land. But it's very difficult for me to think of a case where time-limited retention is something I'd feel safe with, and with limited-endurance memory I'd worry about wearing it o
198.
by dooglius 1y ago
That's fair, I'm implicitly assuming the area cost for this dedicated memory would be much larger than that of e.g. SIMD vector banks.
199.
by dooglius 1y ago
I'm not seeing the case for adding this to general-purpose CPUs/software. Only a small portion of software is going to be able to be properly annotated to take advantage of this, so it'd be a pointless cost for the rest of us
200.
by dooglius 1y ago
Needs (1992)
201.
by dooglius 1y ago
The purpose of ECC has nothing to do with being "end-to-end". A typical CPU path to/from DRAM will not be end-to-end either, since caches will use different encodings. This is generally considered fine since each I/O seg
202.
by dooglius 1y ago
> which it did adequately What makes you think this, given the subsequent events?
203.
by dooglius 1y ago
Overreach for sure, but I don't buy at all that rubbernecking is "obviously of public interest"; hardly the Pentagon Papers we're looking at here.
204.
by dooglius 1y ago
I don't see how. Consider the block of minimum altitude, what's stopping it from falling?
205.
by dooglius 1y ago
is_heap doesn't seem like a particularly useful operation though, generally a heap is intentionally constructed as such via push_heap/pop_heap
206.
by dooglius 1y ago
For the downvoters: that's a quote from Larry Wall, not an insult.
207.
by dooglius 1y ago
You could do intersection by iterating over the dense vector though, not sure why you would need to iterate over the sparse one
208.
by dooglius 1y ago
Seems like the heap allocator has a bug if it doesn't handle invalidating the free hint before it returns it to the application. This does raise the question of why MADV_FREE works on the basis of writes rather than accesses -- there a
209.
by dooglius 1y ago
One thing worth pointing out is that Linux makes it pretty difficult for userspace to access uninitialized memory; the MAP_UNINITIALIZED flag for mmap has to be specifically configured but generally isn't, so the memory does get zeroed
210.
by dooglius 1y ago
Why would iterating over the dense vector be O(m) rather than O(n)?

More ›