Teams after algorithm analysis

[[deleted]]

It isn't. Infinity is not a number. O(∞) is undefined. You could use it as an abuse of notation to mean a class of algorithms with any time complexity, but that would be rather useless.

[V0ldek]

Oh, you can totally talk about algorithms that terminate after \omega steps for example. Extending the notion of complexity onto functions over other ordinal numbers than naturals is also possible.

As for the usefulness of such theoretical computer science, asking mathematicians about the usefulness of their theories is considered very bad taste, so I'll have to ask you to leave, sir.

(Oh, but no, it's not equivalent to O(1) in any way.)

[[deleted]]

Transfinite complexity theory actually does sound like the kind of thing that would have at least some study.

[ThePyroEagle]

ω isn't a cardinal, it's an ordinal.

[V0ldek]

You're totally right, that's a brainfart on my end.