Impressive, very nice. Now let's see LLM's space complexity.
this post was submitted on 02 Jul 2023
46 points (92.6% liked)
Programmer Humor
32410 readers
1 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 6 years ago
MODERATORS
O(all the GPUs, all of them)
Hey now, don’t forget all the memory too
And my cache!
/UnexpectedGimli
Eggshell… and is that… Gothic type?
Any algorithm can be O(n^2) if you only want it to be occasionally right.
Function isPrime(number):
return false
Accurate for almost 100% of cases
Any algorithm can be O(1) if you cache all the answers beforehand.
Yes.
And depending how occasionally we're talking, I can code for some very fast solutions when the correctness requirements are low enough.
Alternately, if we want it to only be occasionally fast, I've got a very nice looking and very wrong algorithm for that, as well.