Kogasa

I’m speaking my truth. XR Adderall, crack em open and pour em on me tongue. The caviar of stimulants

My only time-release capsule is filled with little beads, I just pop it open and eat the beads like pop rocks

I’ve been taking 6+ pills a day for years and still can’t get myself to swallow them. I just chew everything. Tasty painkillers and caffeine.

It’s a reach, but the Fourier transformation of a Schwarz (rapidly decaying) function is also a Schwarz function. Compact support is a strictly stronger condition than Schwarz (the function must eventually decay to 0) but doesn’t have this nice property with respect to Fourier transforms, i.e. the FT of a compactly supported function is Schwarz but not necessarily compactly supported

Once every 50 years or so

If my cooking senses are right, it would be like cooking bacon in a stainless steel pan, which is sticky and burny but not impossible

Don’t think it saves bandwidth unless it’s a DNS level block, which IT should also do but separately from uBO

Eddie Bauer and Carhartt are my go-tos. Both carry tons of tall sizes. Wrangler has some too and may be cheaper.

I worked with Progress via an ERP that had been untouched and unsupported for almost 20 years. Damn easy to break stuff, more footguns than SQL somehow

This has nothing to do with Windows or Linux. Crowdstrike has in fact broken Linux installs in a fairly similar way before.

Sure, throw people in jail who haven’t committed a crime, that’ll fix all kinds of systemic issues

Catch and then what? Return to what?

Just explaining that the limitations of Gödel’s theorems are mostly formal in nature. If they are applicable, the more likely case of incompleteness (as opposed to inconsistency) is not really a problem.

Dunno what you’re trying to say. Yes, if ZFC is inconsistent it would be an issue, but in the unlikely event this is discovered, it would be overwhelmingly probable that a similar set of axioms could be used in a way which is transparent to the vast majority of mathematics. Incompleteness is more likely and less of an issue.

It’s extremely unlikely given the pathological nature of all known unprovable statements. And those are useless, even to mathematicians.

Nobody is practically concerned with the “incompleteness” aspect of Gödel’s theorems. The unprovable statements are so pathological/contrived that it doesn’t appear to suggest any practical statement might be unprovable. Consistency is obviously more important. Sufficiently weak systems may also not be limited by the incompleteness theorems, i.e. they can be proved both complete and consistent.

Yes. A matrix is unitary if the conjugate transpose (conjugate as in “complex conjugate”) is equal to its inverse.

Still not enough, or at least pi is not known to have this property. You need the number to be “normal” (or a slightly weaker property) which turns out to be hard to prove about most numbers.

It sounds like you don’t understand the complexity of the game. Despite being finite, the number of possible games is extremely large.

These things are specifically not defined by the protocol. They could be. They’re not, by design.