[AlotOfReading]

You can get Turing completeness by wrapping your datalog query in a while loop, so that's not particularly restrictive.

[ModernMech]

In the case of Datalog, it not being Turing-complete is usually seen as a feature rather than restrictive.

[Dylan16807]

You can get Turing completeness by wrapping basically any math or logic system in a while loop, even arithmetic. So that doesn't tell us much about the restrictiveness of the overall system since I'd call "you can only use arithmetic" pretty damn restrictive.

[baq]

It’s surprisingly hard to design a useful language which isn’t Turing-complete, so it should be seen as a compliment, not a problem to fix