Is safe tuple relational calculus a turing complete language?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Let’s forget about safety. By Codd’s theorem, relational calculus is equivalent to first order logic. FOL is very limited, it can’t express the fact that there’s a route from a point A to point B in some graph (it can express the fact that there’s a route from a point A to point B in limited length, for example ∃x ∃y ∃z ∃t route(a,x) and route(x,y) and route(y,z) and route(z,t) and route(t,b) means there’s a route of length 4).
See descriptive complexity for a description of what is the strength of different logics.