How do you mean sub-Turing languages don’t allow recursion? Aren’t context-free languages, for example, literally recursive?
Recursion in a pushdown automata (the equivalent machine for a CFL) is bounded by the input words being consumed, since each state transition consumes one input token. Since all input words are finite, indefinite recursion is excluded.