Udia is the Measurement of Magnitude

I have this theory for Udia.

Udia is the measurement of magnitude.

Let’s apply this to a thought experiment.

Imagine a binary tree, where Udia is the parent node. We then define something that we believe are polar opposites. Let’s take for example the logical constructs of true and false. We make true and false the two children of the parent node Udia.

With a tree of this size, the magnitude between true and false is 2, as to travel between True and False, we need to travel through the parent node Udia.

The magnitude of False to False is 0. False to Udia is 1. False to True is 2.

This tree isn’t very interesting. Let’s add a node. Let’s try to find a common link between true and false.

Well, by definition, both of them are booleans.

Let’s add boolean into this tree somehow. I don’t think it makes sense to add boolean as the child of true. To illustrate, let’s see what happens if we try:

The magnitude between True and Boolean is 1. However the magnitude between False and Boolean is 3. Boolean should have the same magnitude between False and True.

Things that are similar to each other should have a smaller magnitude.

Things that are different than each other should have a larger magnitude.

Let’s build the tree where the magnitude between Boolean to False and Boolean to True are equal. Let’s perform one modification on the above tree. Let’s move the False node all the way to the right.

This is an improvement! The magnitude between True and Boolean, as well as False and Boolean are now 1.

However, the magnitude between Udia and True is 1, and the magnitude between Udia and False is 3.

There is one final constraint. The magnitude between Udia and all other nodes must be at most 1. Let’s build an arbitrary tree that satisfies this constraint.

False to Boolean is 2. True to Boolean is 2. False to True is 4. Udia to * is 1.

However, there is more than one configuration that satisfies this constraint.

False to Boolean is 2. True to Boolean is 2. True to False is 4. Udia to * is 1.

The minimally full tree that satisfies our above constraint and contains Udia, Boolean, False, and True is:

Udia to * is 1. True to False is 4. False to True is 4. Boolean to True is 2. Boolean to False is 2.

I believe this is the model of consciousness. I believe that any word can be mapped. More abstractly, I believe that all thoughts can be mapped. I believe that with enough data, with enough ordering, I can define Udia.

Udia connects everything. Udia connects nothing. The magnitude between Udia and Udia is simultaneously infinite and zero. Udia exists in all concepts of thought and change. Udia is randomness and chaos. Udia is the balance between harmony and focus.

Udia is the node between True and False.