3,448 karma · joined May 22, 2013
Then with static linking, the maximum memory requirement is 70MB for said extensions (statically linked into the PHP executable).
> > []the[] point not on a plane will evaluate to 1
They mean the vertex (of the tetrahedron). The signed distance function is scaled such that the (single remaining) vertex that isn't at distance 0 (by construction) will instead be at distance 1. So the distance is always scaled in a unique well-defined way (assuming not all four points are coplanar). Whether that way of scaling is useful depends on your use case, of course.
Meanwhile, CMOS logic inherits both of these problems (in return for better performance in general), but due to semiconductor chemistry, PMOS transistors are weaker than NMOS ones (which was why NMOS was more widely used than PMOS in the first place), so NAND gates have two strong transistors in series and two weak transistors in parallel, which gives a better worst-case switching speed than a NOR gate (where the weak transistors are in series, and so switch noticably slower). This is where "NANDs are used for everything" comes from.
Definitely unambiguously the first unless they're the ones trying to "well acshually" it. At the point of the second you're not even talking about burgers - the maximum cheapness calories per dollar is a five gallon jug of corn syrup or something.
Out of context, that sounds like a kite. Can it be used in locations that are not very windy (like, for example, space)?
Or used.
sk_identity is static over the lifetime of the device, so doesn't need new entropy.
sk_device is generated after pk_user is recieved, so can use HASH(sk_identity,pk_user) as entropy. This results in the same pk_device for every session with a given pk_user, which theoretically enables traffic analysis, but the security model implies traffic analysis is out-of-scope.
signature and enc_sig might need entropy as well, but can still use HASH(sk_identity,pk_user).
t += (float)((double)0.02f * (float)17);
to achieve the "and then converting the result [of the multiplication] to float" (rather than keeping it a double for the addition) from your original comment. (With the above line in mul_as_double, your test code no longer finds a counterexample, at least when I ran it.)If you ask for higher-precision intermediates, even implicitly, floating-point compliers will typically give them to you, hoped-for efficiency of single-precision be damned.
In principle, not quite. The real/unavoidable(-by-the-compiler) problem is that 0.02 is a not a diadic rational (not representable exactly as some integer over a power of two). So its representation (rounded to 52 bits) as a double is a different real number than its representation (rounded to 23 bits) as a float. (This is the same problem as rounding pi or e to a double/float, but people tend to forget that it applies to all diadic irrationals, not just regular irrationals.)
If, instead of `0.02f` you replaced `0.02` with `(double)0.02f` or `0.015625`, the optimization should in theory still apply (although missed optimization complier bugs are of course possible).
To be a bit more explicit, you use the the die four (4) times, and get 4 Xs, 4 Vs, and 4*IIIII = 20 Is, which is exactly right for I II III IIII V VI VII VIII IX X XI XII. Using IV would mean a 5 Vs, but only 4 Xs, and 17 Is, so you couldn't cut a full set with a single die without using a much larger die (= more work making and using the die) or having extra pieces (= wasted material) left over.
> -these highly experienced guys actually knew what they were doing
> What seems more likely?
Well, when you put it that way... the former. By a large margin.
Nitpick: that should be "no single continuous deterministic function"; it's (relatively) very easy to sample uniformly randomly from the unit circle orthogonal to a given non-zero vector, but that won't give, for example, approximately the same result on two consecutive video frames, such that you could usefully orient the camera with that direction "up".
And, proving that any curt correction of a silly error will likely contain its own silly error, I think that should actually be '^([^a]|a[^b]|a$)*$', since grep defaults to searching rather than matching.
If "I'll need a research team and five years" is actually a valid answer to X (eg: X="How do I determine if a given jpeg image contains a bird?", at least... uh, five years ago), then it's a valid answer for the purposes of answering both X and Y. The problem is people giving incorrect/non-answers like "you shouldn't do that", and then pretending they answered the question because they also gave a (presumed for the sake of argument to be correct) answer to some different question, Y.
No it doesn't. It's something like '([^a]|a[^b]|a$)*'.
In general it scales like '([^a]|a([^b]|$)|ab([^c]|$)|abc([^d]|$)|...)*' (ie, quadratically with the length of the needle, if I haven't overlooked a optimization), but the complement of a regular language is regular, and fixed strings are always regular, so it's always a pure regular expression (including being independent of haystack length).
And software development, as a process, does not have a (finite) mean or variance.
> I think bugs should be stable if you normalize it by a size metric.
Bugs approximately follow a heavy-tailed distribution, such that as the number of samples increases, the empirical average work to fix (and possibly other measures of severity) does not converge to any finite value, but instead increases without bound. (I think roughly logarithmicly, but don't quote me on that.)
In particular, it doesn't satisfy the requirements of the central limit theorem, so a lot of statistical techniques work poorly or not at all on software projects that are large enough, individually, to do statistics on (as opposed to doing statistics on populations of software projects, which seems to mostly work, usually).
I think the search keyword for this is "quasirandom", FWIW.
The obvious thing would be making sure that it's easy to get a unambiguous, natural representation of what a float value actually is. (Similar to what C printf %a specifiers produce, rather than something like Ryu float-to-decimal, which is useful for what a float value means for human-readable purposes.)
0X1.999999999999AP-4
+0X1.999999999999AP-3
=0X1.3333333333334P-2
≠0X1.3333333333333P-2
is ugly (and could be improved[0]), but far more understandable (and less superstition-inspiring) than: 0.1 + 0.2 = 0.30000000000000004 ≠ 0.3
0: At the very least, please make it easy to get "0xA.BCDEFp+1", with capital "ABCDEF" and lowercase "xp", so the digits look like digits and the punctuation looks like punctuation.> deliver a 16-bit microprocessor in 1979. [...] the new "8086" ISA
> Intel's original 8800 project was renamed iAPX-432 and finally announced in 1981
I mean, he wasn't wrong...
> There are essentially no mainstream systems that don't [use PQC/ECC hybrid cryptosystems?].
If so, good. I'll admit my expectations are a bit biased from having to deal with projects that go out of their way to produce defective software (eg DRM, malicious abuse of undefined behaviour by compliers, cloudflare and other captcha-walls, etc) so I tend to assume the worst by default.
That's correct (emphasis on "may", of course), and is why it's absolutely imperative to always use PQC/ECC hybrid cryptosystems rather than pure PQC. See eg [0] for a more detailed explanation.
It should definitely be a even number so that if your machine layout doesn't work modulo 7 tiles (=1 wagon-length), you can group up pairs and use 14 tiles, but it might be helpful to use N=6 or N=12, and sometimes build modulo 21 tiles. (I haven't needed/tryed that so far, so I can't comment on how well it works.)
Not in general, actually. If you standardize on N-wagon trains, and build assemblers (et al) in groups of N, each assembler can take inputs from one wagon in lockstep with N-1 other assemblers taking from the N-1 other wagons, and since productivity is deterministic[0], they'll also produce outputs in lockstep.
This means that as long as all your input trains are balanced (they should be, by being completely full), all your output trains will also be balanced. Science labs are same as any other machine, just without output, and trains feeding a logistics network can unload into active provider chests.
In practice I pretty much only use balancers for a: mining outposts, or b: random kludges, at least when and if I'm using trains as my main transport mechanism.
0: Ask me about quality once 2.0 drops; for now I just special-case uranium processing.
Not if it's included, but I use wget a lot. Checking src/html-url.c, it does not, in fact, support <html> at all (treating it as a unrecognized tag).