Is the recursion limit an implementation detail of the compiler though, or something statically built into the language? If the former there's nothing to preven

Is the recursion limit an implementation detail of the compiler though, or something statically built into the language? If the former there's nothing to prevent the language itself from being Turing complete. (Similar to how every Turing complete programming language today runs on something technically weaker than a Turing machine due to finite memory.)