jkafjanvnfaf

3 ms·

1.
by jkafjanvnfaf 11mo ago
How accurate is this two-pass approach in general? From my outsider's perspective, it always looked like most of the difficulty in implementing Lanczos was reorthogonalization, which will be hard to do with the two-pass algorithm. Or i
2.
by jkafjanvnfaf 11mo ago
"Esports" is not a league. That would be like saying "sports" is a league. There are leagues around some games (like the ones mentioned in the article). There are also events with "league" in the name that are
3.
by jkafjanvnfaf 1y ago
It's new because it makes no sense. There already is an implicit "branch" on every array access in C, it's called an access violation. Do they test for a segfault on every single array access in the code base? No? Then t
4.
by jkafjanvnfaf 1y ago
The only series that release "every 12-18 months" are sports games and Call of Duty, and I can assure you that the overlap between that audience and the Persona one (which has five main-series entries of which barely anyone has pl
5.
by jkafjanvnfaf 2y ago
Nice writeup and algorithm. My first instinct would have been to take the lazy way out and just use a table with 365 entries (or 366, or both depending on the implementation), but this is a lot more elegant.
6.
by jkafjanvnfaf 3y ago
First of all, you are correct that nonlinear optics usually requires high field strengths. But... >Photons are bosons and therefore are very reluctant to interact, essentially requiring nonlinearities. Please don't throw out random
7.
by jkafjanvnfaf 3y ago
For completeness, there are languages that do not require stacks to implement (nor any workarounds that in practice emulate a stack). If you do not support explicit recursion, you don't need one. All variables can be statically allocat
8.
by jkafjanvnfaf 3y ago
The usual technique is to keep a 4-element array of sums (so sum[j] is the sum of all terms of the form a[4*i + j] * b[4*i + j]), and then take the total at the very end. This allows for the use of vectorization even with strict IEEE-compli
9.
by jkafjanvnfaf 3y ago
That is true. Still, we are kind of trading one unintuitive postulate (an invariant speed) for a different one: Why would we ever think that the time interval between two events can depend on the reference frame? Sadly, I feel like SR can o
10.
by jkafjanvnfaf 3y ago
The mathematics are sound, but the reasoning around is unclear to me. The derivation shows that Lorentz transformations and Galilean transformations are the only ones that allow for the equivalence of all inertial frames, which is a nice re
11.
by jkafjanvnfaf 3y ago
MATLAB had its first commercial releases in the mid-80s and had indexing syntax that looks pretty much the same. Since it got popular very quickly, I assume that it is the most immediate source of Fortran 90's indexing style. ALGOL 68
12.
by jkafjanvnfaf 3y ago
After thinking about the problem a bit, I've come up with a completely different approach. I'm sure this is known, but I can't find anything so I'd appreciate if someone can point me to a citation. Generate two independe
13.
by jkafjanvnfaf 3y ago
This does look quite nice. I always felt that the operator precedence / association rules in other stack languages were by far the most difficult thing to get used to, not the nonstandard symbols. This appears more inviting in that reg
14.
by jkafjanvnfaf 3y ago
Hello and thank you for the neat article. I have not finished it yet (I'm still partway through the ML bit), so ignore me if this is explained somewhere, but as far as I can see you only considered "generate and test for solvabili