Impressive, very nice. Now let's see LLM's space complexity.
this post was submitted on 02 Jul 2023
39 points (91.5% liked)
Programmer Humor
32371 readers
425 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
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
as test count approach infinity
Any algorithm can be O(1) if you cache all the answers beforehand.
isnt O(n³) usually simplified to O(n²) anyway ?
No, n³ cannot be O(n²) as otherwise that would mean that there exists a positive constant K and a positive threshold m such that for any integer n greater than m you would have n³ less than K*n², which would be the same as saying n less than K, which cannot hold for any integer n greater than m. So n³ cannot be an O(n²), which means that something that is an O(n³) is not necessarily an O(n²).
It's the other way around, if something is an O(n²) then it is necessarily also an O(n³).