dooglius

12 ms·

211.
by dooglius 1y ago
No one here comes out looking particularly good, but at the end of the day the issue is still unpatched and OP is doing a good thing spreading that information.
212.
by dooglius 1y ago
> what do you expect me to do? Off the top of my head: you could broadcast it more publicly that there is a known issue (particularly important if this is a security issue). You could change code to avoid whatever kernel features trigger
213.
by dooglius 1y ago
I'm not talking about a universe where all elements commute, I'm talking about a situation in which A, B, and C do not necessarily commute but (AB) and C do. For a rigorous definition: given X and Y from some semigroup G, say X an
214.
by dooglius 1y ago
Commutativity is a much weaker claim because one is totally before or after the other. e.g. AB may commute with C so ABC=CAB but it is not necessarily the case that this equals ACB. With asynchrony you are guaranteed ABC=ACB=CAB. (There may
215.
by dooglius 1y ago
Is there an English translation of the paper where he "rules out" most of the existing theories?
216.
by dooglius 1y ago
There's an auto-injector mechanism, at least with my brand; you don't need to needle yourself
217.
by dooglius 1y ago
C++ std::vector<bool>
218.
by dooglius 1y ago
My guess would be that the users hitting different types of issues are mostly the same; someone who can't view an alternative image format is using an obscure old browser or obscure OS that will inevitably have a ton of other issues to
219.
by dooglius 1y ago
> Having an extensible format and electing never to extend it seems pointless. So then it was pointless for PNG to be extensible? Not sure what your argument is.
220.
by dooglius 1y ago
Could one do this directly with transistors or standard cells? Seems very useful for ASICs, particularly structured ASICs which are mapped from FPGA lookup tables of size 4-6.
221.
by dooglius 1y ago
You can have cells with more than one value with the value above 2048 but below 128K, and I don't think your scheme works much in those cases. It seems like an open question as to whether there are more than 2^64 possible states withou
222.
by dooglius 1y ago
If the goal is for the company to maximize profit from having the best page, this is an instance of a very well-studied problem https://en.m.wikipedia.org/wiki/Multi-armed_bandit?useskin=v... and one can do much better
223.
by dooglius 1y ago
I recall discussion (can't find now) that performance would be impacted for Linux if a syscall table lookup had to spill to a second page. That gives a limit of 512 64-bit pointers for syscalls we want to be high-performance, which may
224.
by dooglius 1y ago
This strategy went very poorly for the Death Valley Germans https://news.ycombinator.com/item?id=34676129
225.
by dooglius 1y ago
The interesting part to me (I have a background in both math+programming) isn't so much the encoding of computation but that one can work around the independence of goodstein's theorem in this self-referential way. I think this im
226.
by dooglius 1y ago
A real coin could repeatedly land on its side over and over indefinitely, every time you flipped it.
227.
by dooglius 1y ago
The counter-argument would be that if you consider the name on an account to be something needing security protections, then Looker Studio code should not have had the ability to access the name on an account.
228.
by dooglius 1y ago
Not everything needs to have a purpose. The most likely explanation to me is just that inspiration happened to strike the author as he heard the song.
229.
by dooglius 1y ago
There is an extremely glaring omission of any discussion of GLPs, which makes me suspect the author has a mental block of some kind.
230.
by dooglius 1y ago
Should have followed the tried and true approach of https://xkcd.com/1597/ This sort of thing is how I will never understand the attitude of people who claim that git is not actually confusing and you just have to lear
231.
by dooglius 1y ago
This seems worse for that though, now they can track you better when you move and correlate with your identity better.
232.
by dooglius 1y ago
In what way is a TM the most basic? If you mean in terms of simplicity I think a queue automatic is simpler to explain.
233.
by dooglius 1y ago
What class of system are you talking about where the claim is false? Can you express your statement/definitions rigorously? A system that enters the same state twice will never halt, we know it will keep cycling through the same list o
234.
by dooglius 1y ago
What do you mean "space in your decider"? My decider takes finite but unbounded memory, same as the machine it's deciding.
235.
by dooglius 1y ago
Suppose I were to teach theoretical CS using only RAM models of computation, with no reference to Turing Machine tapes. Would there be any downside to doing this, pedagogically? (Other than, of course, the backward compatibility concern of
236.
by dooglius 1y ago
That doesn't sound right. All my decider needs to do is wait for a repeated state (no halt) or a halt. If the state space is finite then one of these is guaranteed to happen.
237.
by dooglius 1y ago
It's weird to spend paragraphs talking about the incremental improvements to (N+1)/3 and (N+2)/3 and then miss that the new bound is N/3 + c*log(log(n)) for some c>0, not N/3+log(log(n))
238.
by dooglius 1y ago
I think pride would push one in the opposite direction: a prideful student wouldn't want to be seen having to look something up in front of the interviewer.
239.
by dooglius 1y ago
It sounds like this would prevent the inherit concurrency you would get out of handling files separately?
240.
by dooglius 1y ago
Those are examples regarding UB in the C++ language not the UNPREDICTABLE state in the ARM ISA which is what I asked for examples of.

More ›