I do realize that philosophizing like this is much easier than shutting up and calculating.
There’s mathematical laws and principles hidden in my reply, like the path of least resistance, which I consider natural in some sense. It’s hard to formalize this in a way which relates to your main goal.
My intuition, like AI weights, is black-box.
I can try, though: Your N^2 system stores the information of every perspective. There’s no one value of “kind”, kind is a relation and not an atom. You can… Factor out? “kind”, so that you’re storing an objective definition of “kind” next to the graph. Now you have N values for “kind”. The reason people will agree on hair color is because this evaluation doesn’t depend on the individual. Well, it does, but it’s a shared property of the whole graph (unless perhaps one is colorblind), so it’s essentially already factored out. “Compression” here is essentially the same as rounding. Colors are areas on a 1 or 2D spectrum, but we clamp them to the nearest point. This is like mapping R to N, e.g. 4.7 → 5. If the number of unique answers (after the compression) is less than the area of nodes, then you need less than N^2 nodes to store it. But this is probably trivial to you? If we view it as interactions, we can consider the case that two people may never meet. In any case, I think this makes the order of interactions important. People match eachother, and calibrate themselves towards those they interact with, creating local realities. An idea which might be related here is the algorithms that social networks use to sync likes between distributed servers (and I don’t think the order matters here?). They seem to have solved a similar problem (though “number of likes” isn’t subjective). These aren’t quantum-interactions, but I don’t know how important this difference is. By the way, agents transfer information in a memetic manner, and if you focus on the agents rather than the meme, you may miss a part of the picture. Since social constructs are created rather than inherent in the universe, they might not exist in some nodes. And in real life, a node may interact with itself. But I’ll stop here as it’s very unlikely that I know more graph theory than you.
Finally, if my sentences about graphs is “100” on a difficulty scale, then a formalization of my previous comment would be a million. It’s like comparing a college text-book to an unsolved math problem. Take whats useful to you and discard the rest
Thank you!
I do realize that philosophizing like this is much easier than shutting up and calculating.
There’s mathematical laws and principles hidden in my reply, like the path of least resistance, which I consider natural in some sense. It’s hard to formalize this in a way which relates to your main goal.
My intuition, like AI weights, is black-box.
I can try, though: Your N^2 system stores the information of every perspective. There’s no one value of “kind”, kind is a relation and not an atom. You can… Factor out? “kind”, so that you’re storing an objective definition of “kind” next to the graph. Now you have N values for “kind”.
The reason people will agree on hair color is because this evaluation doesn’t depend on the individual. Well, it does, but it’s a shared property of the whole graph (unless perhaps one is colorblind), so it’s essentially already factored out. “Compression” here is essentially the same as rounding. Colors are areas on a 1 or 2D spectrum, but we clamp them to the nearest point. This is like mapping R to N, e.g. 4.7 → 5. If the number of unique answers (after the compression) is less than the area of nodes, then you need less than N^2 nodes to store it. But this is probably trivial to you?
If we view it as interactions, we can consider the case that two people may never meet. In any case, I think this makes the order of interactions important. People match eachother, and calibrate themselves towards those they interact with, creating local realities. An idea which might be related here is the algorithms that social networks use to sync likes between distributed servers (and I don’t think the order matters here?). They seem to have solved a similar problem (though “number of likes” isn’t subjective). These aren’t quantum-interactions, but I don’t know how important this difference is. By the way, agents transfer information in a memetic manner, and if you focus on the agents rather than the meme, you may miss a part of the picture. Since social constructs are created rather than inherent in the universe, they might not exist in some nodes. And in real life, a node may interact with itself. But I’ll stop here as it’s very unlikely that I know more graph theory than you.
Finally, if my sentences about graphs is “100” on a difficulty scale, then a formalization of my previous comment would be a million. It’s like comparing a college text-book to an unsolved math problem. Take whats useful to you and discard the rest