Programmer Humor

32483 readers

314 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.

founded 5 years ago

MODERATORS

AgreeableLandscape@lemmy.ml

cat_programmer@lemmy.ml

205

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/programmerhumor@lemmy.ml

7 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] CanadaPlus@lemmy.sdf.org 2 points 4 months ago* (last edited 4 months ago)

I don't think that quantum physics is quite right, but the gist probably* is. Any finite system can have it's states enumerated on a table. I'd think you'd need to calculate configurations over all of space-time at compile time, and then look up answers by boundary condition.

Interestingly, MIP*=RE from quantum complexity theory implies tangibly infinite quantum states could exist. It's not clear if real physics has that particular feature, though. If it does no finite lookup table will do the job, even approximately.