I'm wondering if a mathematical set definition has a computational complexity.
For example, assume I have some kind of problem where the solution is given by the positive integers smaller than a given integer $n$:
$M = \{ x | x < n, x \in \mathbb{N} \}$
Could I say this problem can be solved in $\mathcal{O}(n)$ because I could realistically construct an algorithm that yields this result in linear time?
I actually have such an approach in a paper where it makes more sense to define a set than give an (trivial) algorithm that returns this set.