CaptainNegative

I think it would have to if you're honest with yourself. Any proof of a novel implication of P=NP, such as !ETH, should increase your belief in the two sets' equality. Just as any novel implication of P≠NP should adjust your belief the other way.

My thesis was around showing implications of few different hardness conjectures. So grounded was ETH that I introduced it in a side note as Conjecture 0 after Conjectures 1 and 2. I don't think it's easy to express how substantial of a Bayesian update this is all around.

Are time and distance, and consequently velocity, even well defined enough at that level of precision on any physical scale?

Yes and no. It's pretty normal for students to get scooped, sometimes even multiple times (ask me how I know...).

It's much less common for students to have their entire thesis direction removed from under them, as might be the case for someone working in fine-grained complexity assuming 3SUM has no subquadratic algorithms, or working assuming ~UGC. Both of which (publicly) seemed like perfectly valid research directions until a couple hours ago.

There might be stuff to salvage from their conditional results anyway, but this is not your average scooping.

I asked Jev and it said 41% yes 59% no.

That is the cash purchaser paying the retailer more than they need to. There's no conservation law stating that store revenue is a constant and missed revenue from one customer must be made up for by another, nor that every additional operating cost must be directly pushed onto customers.

Similarly, we do not say that October shoppers transfer wealth to Black Friday shoppers, even though the only tangible difference from your scenario is an irrelevant temporal one.

They don't count the additions or shifts because they're both linear time operations, and thus provably at least as fast as multiplication (both in an asymptotic and exact sense). In any case where multiplication is super-linear, this means that addition and shifting are are not the temporal bottleneck at any stage in the algorithm where you have a constant number of those operations surrounding at least one multiplicative recursive call (on numbers of similar magnitudes).

If additions were truly free, an even easier optimal algorithm would just be repeated addition involving zero multiplications.

Does he also run a time machine? He bought TikTok only earlier this year.

why is the standard response when someone comes down with a serious illness to bring them into a facility where serious illnesses spread readily?

sometimes the presently available solutions are subpar. people go with what's available. it's not ideal, but it is practical.

I don't know why someone with a cousin named Pablo Diego José Francisco de Paula Juan Nepomuceno María de los Remedios Cipriano de la Santísima Trinidad Ruiz y Picasso is that much of a better hire than someone named Jón Bergþóruson, 王小明, Sukarno (with no surname), גִּדְעוֹן בֶּן־גּוּרְיוֹן , or Karl-Theodor Maria Nikolaus Johann Jacob Philipp Wilhelm Franz Joseph Sylvester Freiherr von und zu Guttenberg. None of whom would classically qualify as diversity hires.

Hiring someone in the off chance that their ethnicity gives them some unique critical unknown unknown that will pop up half a decade down the line resides in the same mental space as a programmer writing `if (5 == i)` in case a future programmer accidentally deletes an =. It's just speculative defensiveness whose efficacy is simply not well established by actual research. And, in my view, just works to confound actual signals that, evidently, gitlab and other employers feel get unfairly overshadowed when emphasizing explicitly pro-diversity hiring policies.

There could also be some degree of "(5) bandwagon effect" players, who pump money into an outcome specifically to get people talking about its possibility, thereby increasing its probability of coming into fruition.

> You can generally reduce the problem to a finite alphabet by taking the finite subset that actually appears in the input.

You can generally sort any array in constant time by taking that constant to be the time it takes to sort the array using bubble sort.

I feel like the section on primality testing with Fermat's test should at least make a shout out to Carmichael numbers and that for some inputs the probability you get a false positive result is 1.