Very interesting! thanks for this. The n-ary relations are bipartite graphs, one partition in the graph is the relations (hyperedges). This is /the/ universal (

Very interesting! thanks for this. The n-ary relations are bipartite graphs, one partition in the graph is the relations (hyperedges). This is /the/ universal (turing machine) theorem of computing. By the way, check out datalisp.is, I think we should re-encode the web :)