404
Not everything can be done in constant time, that's O(k) (sh.itjust.works)
submitted 4 months ago by alphacyberranger@sh.itjust.works to c/programmer_humor@programming.dev
41 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[-] Mikina@programming.dev 1 points 4 months ago* (last edited 4 months ago)

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?

this post was submitted on 22 Jun 2024
404 points (97.4% liked)

Programmer Humor

19564 readers
513 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev