Noah is great. I Finished a Video Game also hits this sweet spot very well.
- 0 Posts
- 10 Comments
Fun fact, snakes’ adaptations to their feeding style are actually not about the way the jaw hinges. Instead, their lower jaw is two separately moving bones held together with stretchy ligament tissue so that each side of the mouth can be “walked along” the prey item separately.
So the chef could eat the burger… but would follow along its longest dimension to do it, laying it down sideways.
MagosInformaticus@sopuli.xyzto politics @lemmy.world•How Pam Bondi will get round Constitution to give Trump a free flying palace11·2 months agoNo Person holding any Office of Profit or Trust under [the United States], shall, without the Consent of the Congress, accept of any present, Emolument, Office, or Title, of any kind whatever, from any King, Prince, or foreign State.
US Constitution section 9 clause 8.I’d say that’s pretty clear an official act to the giver’s benefit is not a necessary element of the prohibited conduct. If something is offered, both houses of congress must vote to allow it or the gift must be declined.
MagosInformaticus@sopuli.xyzto Explain Like I'm Five@lemmy.world•ELI5 how `P`, `NP`, `NP-Complete`, and `NP-Hard` work? If you have a video you'd recommend that works tooEnglish11·7 months agoSome computing problems are “easy”* to solve. We call these P.
Some problems let us easily check a proposed solution if we’re given one. We call these NP.
All problems in P are also in NP, since checking a solution proposal works is never harder than solving the problem starting from nothing.
We suspect but can’t prove that some problems in NP are not in P.It turns out that it’s possible to translate any problem in NP into the boolean satisfiability problem (SAT) using an easy algorithm, so this problem effectively is an upper bound on how hard it could be to solve problems in NP - we could always translate them into SAT and solve that instead if that sequence is easier.
We call SAT, and any problem that it can be translated into easily in the same way, the problem class NP-hard.
NP-complete is just those NP-hard problems which are also in NP, which is many but not all of them.*: require asymptotically polynomial running time
MagosInformaticus@sopuli.xyzto Programmer Humor@programming.dev•Some of my iterations are delightfully recursiveEnglish13·1 year agoOr sometimes fold them over trees of objects!
MagosInformaticus@sopuli.xyzto politics @lemmy.world•Minority rule is threatening American democracy like never beforeEnglish73·1 year agomake reapportion something that happens every 10 years with the census
That’s… the current state of affairs? New apportionments of Rep seats to states take effect on the 4th year of each decade and have done so consistently since 1933 and in particular the 1929 Permanent Apportionment Act. It also does little for the major structural issues with voting, which are much more about voting method and the drawing of voting district lines.
MagosInformaticus@sopuli.xyzto politics @lemmy.world•Project Veritas admits there was no evidence of election fraud at Pennsylvania post office in 2020English1·1 year agoIt’s genuinely funny to me that one of O’Keefe’s major sins in the eyes of his conservative donors was being such a theater kid he staged a musical hagiography of himself.
MagosInformaticus@sopuli.xyzto politics @lemmy.world•Moderate Democrats get behind temporary speaker fixEnglish1·2 years agoAh yes, the Bismarck solution.
MagosInformaticus@sopuli.xyzto politics @lemmy.world•Biden’s UAW Rally Exposes the Bankruptcy of Trump’s PopulismEnglish1448·2 years agoIt’s only 1 year ago Biden signed legislation forcing the railroad unions back to work with only 1 day of paid sick leave per worker per year. While as the author says it “One party is capable of rallying to labor’s side”, that feels very much like putting the bar on the ground.
deleted by creator