All in All

I have spent a few days exploring what has been termed a very complex problem.

This type of problem was in some ways familiar to me and I applied a variation of a technique I used before in my work on True Machine Learning.

Although I didn’t solve the problem, I was able to formalize it in precise terms and I was very pleased with the fact that this formalization relied on what is a graph theoretical version of the known philosophical principle all in all.

I created a property of a node in a graph that is described in terms of the geometry of the entire graph to which it belongs, relative to the place this node has in it. This means that the entire geometry of a graph has a version of it described from the point of view of each of its nodes.

The whole is reflected in each of its elementary constituents.

And that is beautiful.