Would relational calculus be Turing-complete if it allowed unsafe queries?
- by Jason Baker
My understanding about Codd's concept of "safe queries" was created to ensure that a query would always terminate. One of the key ability of a Turing machine is that it can work on infinite calculations (and thus isn't guaranteed to terminate). If the safe query restriction were removed, would relational calculus be Turing-complete since that means it doesn't have to terminate?