News for hackers. Stuff that matters.

A comment on Solving the 1+N Query Problem. Parent comment

Re:Solving the 1+N Query Problem by cryptonector on Tuesday August 25, 2026 @03:58PM (#49439766)
If you can do Peano numbers...

Guaranteed termination isn't really if you give me enough rope to implement the Ackermann function.

[ Parent | on HN ]
Re:Solving the 1+N Query Problem by debugnik on Tuesday August 25, 2026 @09:43PM (#49443164)
Pure Datalog can't express peano up to infinity, its terms can't be functors as in Prolog. At best you could hardcode a successor relation up to a limit.
[ Parent | on HN ]