Can a dependently typed language be Turing complete? [closed]

It seems as though dependently typed languages are often not Turing complete. Why can we not allow every function to have general recursion (which would make the language Turing complete), instead of only allowing a more restricted form of recursion?

Is something preventing creators of dependently typed languages from allowing all functions to be capable of general recursion?

For example:

• Agda: https://en.wikipedia.org/wiki/Agda_(programming_language)#:~:text=Agda%20is%20a%20total%20language,possible%20to%20prove%20arbitrary%20statements
• Coq: What are the practical limitations of a non-turing complete language like Coq?