tomsmeding

9 ms·

91.
by tomsmeding 2y ago
On modern 64-bit machines, sizeof(int) != sizeof(int*) is very true. But there's probably a significant amount of code that assumes it's equal to sizeof(uint64_t) or sizeof(long). :)
92.
by tomsmeding 2y ago
The domain name kind of suggests this interpretation, too.
93.
by tomsmeding 2y ago
That's milliseconds; nanoseconds are 1e-9 seconds. Still, the file creation time remark of sibling is pertinent.
94.
by tomsmeding 2y ago
In a class we had to reverse-engineer an application that had encrypted some text file — we had to decrypt it without the key. Turned out the application just used the current unix timestamp as the key. A brute-force search of the past few
95.
by tomsmeding 2y ago
I can't help but feel this is reintroducing some of the problems it claims to solve in working around the difficulties. * The fact that there is an `Oom` error that can be thrown means that there is no increase in reliability: you stil
96.
by tomsmeding 2y ago
GrapheneOS unnecessary. Plain Android with Firefox and uBlock Origin suffices.
97.
by tomsmeding 2y ago
I see, I read the docs slightly too quickly. Still, though, I would have expected a conspicuous warning about exceptions in those calls, because MS is in on C++ (so they can't hide behind "but we expected only C") and apparen
98.
by tomsmeding 2y ago
Everyone here is going on about exceptions bad, but let's talk about QueueUserAPC(). Yeah, let's throw an asynchronous interrupt to some other thread that might be doing, you know, anything! In the Unix world we have this too, and
99.
by tomsmeding 2y ago
Presumably, ReadableStream does not auto-reconnect.
100.
by tomsmeding 2y ago
The caniuse link in the OP, under Known Issues, notes that Firefox currently does not support EventSource in a service worker. https://caniuse.com/?search=EventSource
101.
by tomsmeding 2y ago
It's worth noting that Simon Marlow is at Meta, and indeed is also the author of the present article.
102.
by tomsmeding 2y ago
Are you on Windows?
103.
by tomsmeding 2y ago
Thank you, this should have been on the front page. That makes this a fun calculus, I guess, but isn't necessarily any more amenable to inversion (hard), serialisation (easy), or compilation (easy-ish) that something like SKI or lambda
104.
by tomsmeding 2y ago
Thanks a lot for the insights!
105.
by tomsmeding 2y ago
> Specifically, the absolute value handling of rounding error analysis will cause the error bounds to diverge from being proportional to the function and/or derivative values. Oh, I see! Not quite autodiff then, indeed. > Long su
106.
by tomsmeding 2y ago
Context: I'm writing an autodiff algorithm, and that's the thing I want to test. > one strategy to consider would be to build the error bound computation as a function into your math operations That's autodiff! :D The erro
107.
by tomsmeding 2y ago
"2" being a large number of people to be killed in a crime does not necessarily make it sensible (to me, a Dutchman, very much not American) to call that crime a "mass shooting". If the crime was e.g. a bank robbery (sor
108.
by tomsmeding 2y ago
I count 12 different "nothing-up-my-sleeve" numbers in the examples section. If this is a list of noteworthy ones, it wouldn't be off to say there's certainly 16 believable choices, which is already 4 bits of entropy.
109.
by tomsmeding 2y ago
Right, this is if you know the exact operations that your computation does, and that list is small enough. My usecase is testing an autodiff algorithm. So I have larger programs (for which doing this process would be quite cumbersome alread
110.
by tomsmeding 2y ago
This happens not only in math libraries but even in compilers. An x64 processor has two ways (at least) to perform simple 64-bit floating-point operations: with SSE registers (using only one of the slots in the vecror), or with the older x8
111.
by tomsmeding 2y ago
But then relative error is also not a panacea. If I compute 1 + 1e9, then producing 1e9 - 1 instead would fall within a relative error bound of 1e-6 easily. More generally, relative error works only if your computation scales "multipli
112.
by tomsmeding 2y ago
If you have O(1) arbitrary-precision floating-point operations in O(1), you can do Fibonacci in O(1) by Binet's formula. But you don't, so you can't. Also, by a similar argument, the O(log n) by matrix exponentiation is reall
113.
by tomsmeding 2y ago
I stand corrected, you clearly know more about this than I do. :) (I'm only an intermediate learner.) So perhaps my analysis of 袋小路文 wasn't very accurate at all. Yet I hope my point about 正, 生, 書, etc. stands.
114.
by tomsmeding 2y ago
Yes, this happens in English too, but to find examples like this you have to go to Wikipedia, or wrack your brain and see if you remember one. In Japanese, almost every other word is like this. I went to the first link in your comment ( ht
115.
by tomsmeding 2y ago
> I asked if the compiler preserved the asserts when not compiling in debug mode. What was the answer?
116.
by tomsmeding 2y ago
> to make the OED (the full and proper one) available outside of a university proxy. Was the plan to do this in a legal fashion? If so, how?
117.
by tomsmeding 2y ago
> highly randomized (you don’t get to choose Summer2024!) Sure. > designed to be stored offline somewhere as a break glass. That's fair. > The OTP is usually very long, No, 10 digits is not very long, that's just 10^10 (a
118.
by tomsmeding 2y ago
There is already a call to MD5 in the original query; see the first image in the article, which they apparently obtained by submitting ' as the username: https://images.spr.so/cdn-cgi/imagedelivery/j42No7y-dco
119.
by tomsmeding 2y ago
That sounds like chaos. Who thought constructing multiple apartment buildings without any kind of sensible post code or address was a good idea? Sure, this being reality BAN does not apparently meet reality, but it does sound like someone h
120.
by tomsmeding 2y ago
For disappointed readers expecting a language that actually works in a grid, the original 2D programming language, Befunge: https://esolangs.org/wiki/Befunge There are more, such as ><> https://es

More ›