While SQL can model Turing computation using recursive SQL functions and side effects, TypeQL's core syntax is much simpler and has neither functions nor side effects. Nonetheless, it's reasoning engine can be used to model Turing computation. This repositories contains a demonstration of this fact, by implementing SKI combinator calculus as a TypeDB database.
-
Notifications
You must be signed in to change notification settings - Fork 0
cxdorn/typedb-turing-completeness
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Short demos modelling turing computation in TypeDB
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published