News for hackers. Stuff that matters.
Re:A ride that takes 10^20k years to complete in Roller Coas... by atq2119 on Monday August 03, 2020 @05:23PM (#24043624)
Note that calling it 2^O(N) (or Omega) would be more accurate, unless you stumbled upon a really lucky coincidence.
Re:A ride that takes 10^20k years to complete in Roller Coas... by MaxBarraclough on Tuesday August 04, 2020 @04:44AM (#24047945)
Interesting, I'd never seen this kind of thing.

Related: https://en.wikipedia.org/wiki/Big_O_notation#Multiple_uses

Re:A ride that takes 10^20k years to complete in Roller Coas... by titanomachy on Monday August 03, 2020 @05:51PM (#24043881)
Are there any functions f(n) ∈ O(n) such that 2^(f(n)) ∉ O(2^(n))? If not, then either statement is accurate.
Re:A ride that takes 10^20k years to complete in Roller Coas... by gnramires on Monday August 03, 2020 @06:02PM (#24043984)
Yes, for example 2^(2n) ∉ O(2^(n)). Any function of a different linear coefficient. Big-O notation represents a bound by a constant factor (by modifying the exponent multiplier you get an exponential factor).
Re:A ride that takes 10^20k years to complete in Roller Coas... by titanomachy on Tuesday August 04, 2020 @06:34PM (#24055228)
Thanks, you're right of course.