Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
cryptonector
60 days ago
|
parent
|
context
|
favorite
| on:
Solving the 1+N Query Problem
If you can do Peano numbers...
Guaranteed termination isn't really if you give me enough rope to implement the Ackermann function.
debugnik
60 days ago
[–]
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.
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Guaranteed termination isn't really if you give me enough rope to implement the Ackermann function.