The Binary Tree City
I want to live in a Binary Heap City. I think everyone would if they were to think about Trees long enough. I started thinking about Binary Tree Cities beginning with a Medical School Bio-medical Neuroscience class. And again and again later as a mathematician and law student.
A Binary Tree City is an organization of people with minimum data entropy. That is, it is The Most Highly Organized organization form. Organizing people according to a Binary Tree (nick named Heap) does not imply a rigid bureaucracy. Quite the opposite, the Heap allows people to have much more elastic and dynamic relationships because the Heap is reducing entropy on several dimensions. Reduced entropy is like pure capital; enabling increased rates of change in other dimensions. Much, if not a theoretically provable exactly, like the minimum uncertainty principle which controls precision measurements of position and momentum.
The Binary Heap City is formed like the American Republic form of government, the reverse of top down pyramid like corporations. Delegates are chosen from statistically significant pairs of individuals and existing pairs of entities, i.e. a recursive notion of pairs of pairs. The tree is organized in two dimensions; i.e. similarity and popularity. Pairs converge in similarity. Delegates are chosen from pairs based on popularity.
Organizing people into The Most Highly Organized form takes a lot of computational power. Particularly if one approaches the problem from a naive viewpoint. However, with the assumption of some auto-correlation in the time interval with respect to measurements of similarity and popularity; the problem can be bucketed and linearized across a vertically scalable machine set.
I have started to write a software platform for this but am still somewhat amateur and unfocused. If interested in working with me to build an open sourced Binary Tree City please see github.com/ai10