SQL is turing complete if you write queries with recursion and window functions. So the question is sort like asking about the big-O complexity of a C program and depends entirely on your application.

The only difference is that SQL is fairly good at changing algorithms for you and at automatically finding a plan that is a lot better than naive code, as long as you give it access to the right data structures.