Ugh, thank you. I seem to have gotten complexity classes and algorithmic complexity mixed up. Busy Beaver’s algorithmic complexity grows asymptotically faster than any computable function, so far as considerations like Big-O notation are concerned. In those sorts of cases, I think that even for functions like e^BB(n), the BB(n) part dominates. Or so Wikipedia tells me.
ETA: cousin_it has pointed out that there uncomputable functions which dominate Busy Beaver.
Ugh, thank you. I seem to have gotten complexity classes and algorithmic complexity mixed up. Busy Beaver’s algorithmic complexity grows asymptotically faster than any computable function, so far as considerations like Big-O notation are concerned. In those sorts of cases, I think that even for functions like e^BB(n), the BB(n) part dominates. Or so Wikipedia tells me.
ETA: cousin_it has pointed out that there uncomputable functions which dominate Busy Beaver.
Sure, but my point is it’s not the “fastest” of anything unless you want to start defining some very broad equivalences...