ORB Visualization
(soon)
Dick Ballard said:
You can stick with statistics if you want by going to factor or sensitivity analyses and eigenvectors that unlock an unconstrained wider circle of situational and intentional dimensions.
My work is not based on statistics, but on category theory. There is a great difference.
However, in working on scatter gather techniques on a one –point compactification of a line I came to understand a series of theorems that use category theory (i.e. a mapping between arguments can sometimes allow a proof of one argument that implies that the mapped argument is also true.)
One way into my thinking on this is to look at my report on Russian “cognitive graphs” to Army Research Lab or into the foundational paper on SLIP structures.
The fundamental theorem is related to what I published as a conjecture
Conjecture 1 (October 17th, 2001): There exists a unique decomposition of a set of atoms into primes using a purely algorithmic process. This unique decomposition will be produced each time the SLIP algorithms are run, given that the algorithms find any splitting subset S that exists in any prime core. (see foundational paper on SLIP structures.)
This unique decomposition is generalizable in the case where one has more then one type of relationship, as well as to n-ary relationships. The work to show this has not been done because I have not been in a position to work on this.
But… there is an generalization and this generalization places your work fully into a single notational framework.