(samwho.dev)

688 points samwho | 1 comments | 24 Aug 25 07:39 UTC | HN request time: 0s | source

Show context

dekhn ◴[25 Aug 25 21:44 UTC] No.45019410[source]▶

What blows me away is that there are quantum calculations which grow as O**7 with respect to the number of atoms and scientists are fine with running them because N is small, computers get faster and more memory all the time, and the results are valuable.

(I'm not a computer science expert, so if I used the O(n) terminology differently from the standard, sorry).

replies(2): >>45020178 #>>45021948 #

1. JohnKemeny ◴[25 Aug 25 22:57 UTC] No.45020178[source]▶

>>45019410 #

You can simply say grows as n⁷. Although people will understand what you mean by saying O(n⁷), O is an upper bound, not a lower bound.

What you should say if you want to be correct is it grows as Ω(n⁷).

↑

A visual introduction to big O notation