Hacker News Reader

> yes it is

Can you double check and/or give references? Because I specifically doubted my memory here, and everything I found online before posting matches what I thought—-standard relational algebra is not Turing-complete (hence relational queries are guaranteed to terminate).

View on HN

I need to do some more checking, but you are right. The original relational algebra was a subset of first-order predicate logic. Adding recursion I believe just gave it parity with 1st order PL, so fulsome apologies and thanks for pointing out my error.

Fair Q, I may be confusing relational and predicate calculus. Will check and get back. Apologies in advance if I'm wrong.

Reply on news.ycombinator.com