sh.itjust.works

I_Fart_Glitter , to cats in Big orange energy

https://lemmy.world/pictrs/image/61338fc4-55b8-48b3-8700-fb9538abf7a5.gif

Evil_Shrubbery , to cats in Big orange energy

Boop

rockSlayer , to cats in Big orange energy

This one has gone far too long without their share of the brain cell. I love them

Maeve , to cats in Big orange energy

Made my day! Thanks.

Lost_My_Mind , to cats in Big orange energy

Well hello, Ted.

I've decided his name is Ted. He looks and acts like a Ted.

faizalr , to cats in Big orange energy
@faizalr@kbin.run avatar

I can't get close enough.

FuglyDuck , to cats in Big orange energy
@FuglyDuck@lemmy.world avatar

HAI!!!

Justas , to cats in Like the morning dew
@Justas@sh.itjust.works avatar

Also, shower water

And plant water

Freshly washed fruits and vegetables

6mementomori , to Programmer Humor in Programming as a hobby means I can do whatever I want!

I don't nearly know enough to understand this but is anyone willing to help me get the thing on the top :>

Leah96xxx , to memes in Not like that

Fit fit fits fit fit?

(That's technically 2 words, with one said 4 times. There's 2 different meanings of it though)

Mesa , to Programmer Humor in JavaScript
@Mesa@programming.dev avatar

I'm in this no-experience-to-apprenticeship program and everyone in my class thinks type coercion is the greatest thing ever.

librejoe , to memes in It was worth it

Me staring into space listening to a serious debate wondering what would Albert Einstein and Claude Shannon do if they were still alive today.

Mikina , (edited ) to Programmer Humor in Not everything can be done in constant time, that's O(k)

It has been a while since I have to deal with problem complexities in college, is there even class of problems that would require something like this, or is there a proven upper limit/can this be simplified? I don't think I've ever seen O(n!^k) class of problems.

Hmm, iirc non-deterministic turing machines should be able to solve most problems, but I'm not sure we ever talked about problems that are not NP. Are there such problems? And how is the problem class even called?

Oh, right, you also have EXP and NEXP. But that's the highest class on wiki, and I can't find if it's proven that it's enough for all problems. Is there a FACT and NFACT class?

HootinNHollerin , to cats in Like the morning dew

Get a fountain

Kolanaki , to Programmer Humor in Not everything can be done in constant time, that's O(k)
@Kolanaki@yiffit.net avatar

Wait... How can time ever not be constant? Can we stop time?! 😮

  • All
  • Subscribed
  • Moderated
  • Favorites
  • •
  • kbinchat
  • All magazines
    •