393
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 30 May 2024
393 points (87.7% liked)
AnarchyChess
4899 readers
57 users here now
Holy hell
Other chess communities:
!Chess@lemmy.ml
!chessbeginners@sh.itjust.works
founded 1 year ago
MODERATORS
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).
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