this post was submitted on 30 May 2024
397 points (87.8% liked)

AnarchyChess

5841 readers
121 users here now

Holy hell

Other chess communities:
!Chess@lemmy.ml
!chessbeginners@sh.itjust.works

Matrix space

founded 2 years ago
MODERATORS
itszednotzee@sopuli.xyz
itszednotzee@lemmy.antemeridiem.xyz
Fubarberry@sopuli.xyz
397
if this post gets 32 upvotes, i will post again with twice as wide en passant (lemmy.world)
submitted 1 year ago by Rainb0wSkeppy@lemmy.world to c/anarchychess@sopuli.xyz
33 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[โ€“] kogasa@programming.dev 2 points 1 year ago (1 children)

O notation has a precise definition. A function f : N -> R+ is said to be O(g(x)) (for some g : N -> R) if there exists a constant c so that f(n) <= cg(n) for all sufficiently large n. If f is bounded, then f is O(1).

[โ€“] lugal@sopuli.xyz 1 points 1 year ago

If n is in O(1), than any O(f(n)) is O(1) but who says the number of lemmy users is bounded? We will grow and we will continue to grow. When economists calculate with infinite growth, so can we