Saturday, December 7, 2013

What is Turing Completeness in a graph context?

I simply noted that if one did a Turing traversal of one graph; point by point, with another graph. That is a binary operation. Shannon noticed this when he made multipliers from simple Boole networks. No big deal. It seems obvious that a binary graph completeness is implied in any standard database operation. So, the fact that JSON expression graphs can be joined should come as no surprise, except for a few query operators that guide the traversals and collect the matches.

My idea od JSON snobbery is don't ditch Javascript.  No, the idea is to keep as close to Javascript as possible, and bring it along as JSON expands. Make it part of the expression graph.

No comments: