AnarchyChess

5194 readers

155 users here now

Holy hell

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

Matrix space

founded 1 year ago

MODERATORS

itszednotzee@sopuli.xyz

itszednotzee@lemmy.antemeridiem.xyz

395

if this post gets 32 upvotes, i will post again with twice as wide en passant (lemmy.world)

submitted 5 months ago by Rainb0wSkeppy@lemmy.world to c/anarchychess@sopuli.xyz

34 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 5 months 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 5 months 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