Is there exists a recursively enumerable set of computable total fast-growing functions $(\mathbb N \rightarrow \mathbb N)$ such, that this set has no upper boundary in the set of all such functions (up to a dominance relation)? 

Clearly, you can't enumerate some set of such functions in increasing order since diagonalization gives computable upper boundary, but what if we enumerate functions in some unknown order?