- #1
Organic
- 1,224
- 0
Let us say that we wish to construct and explore a non-trivial numerical form of structural/dynamic abstract or non-abstract complex models.
If there was a way to choose the unique building blocks that we need for this goal, it was our gate to the universe of complexity exploration.
For this goal we need at least to properties:
1) A quick way to find any needed complex building block.
2) An ordered collection of unique complex building blocks.
Let us say that we want to construct a model of an information tree, where each building-block is a sub-tree that represents information clarity degree.
The result of this construction is a very complex model of finite or infinitely many ordered or unordered levels of information's clarity degrees upon finite or infinitely many different scales.
An example of (1) and (2):
http://www.geocities.com/complementarytheory/ETtable.pdf
An example a complex model can be found here:
http://www.geocities.com/complementarytheory/ComplexTree.pdf
Please be aware that the Natural numbers are used here as a private case of the clearest information tree, which is used here to find the exact x,y location of each unique building block, but it does not give us any information on the internal unique structure of this building block.
More than that, we cannot use the natural numbers to quantify the internal structure of any given buiding-block, which is based on uncertainy_AND_redundancy > 0, because the value of n>0 in this case, is a general representation of several random and different possibilities between 0 and k>=n.
Shortly speaking, our building-blocks locations can be found by N members, but their internal structure cannot described by them, because N members internal information structure, is based on 0 redundancy AND 0 uncertainty information form.
An example:
Let us take the trees that included in quantity 3:
{1,1,1} , {{1,1},1} , {{{1},1},1}
The first is a multiset and the last is a "normal" set.
For example let us say that there is a piano with 3 notes and we call it 3-system :
I like to look at the connection between redundancy_AND_uncertainty as "a cloud of possibilities", you know like the possibilities that we have in some Quantum element in the same space/time.
For example:
Let C be a closed door.
Let O be an opened door.
Let # be XOR.
When we are using N members to describe information form which its redundany_AND_uncertainty levels are greater than 0, the best we can do is to use multiplication and addition as complementary operations, for example please look at page 7 (in the paper, not in the acrobat screen):
http://www.geocities.com/complementarytheory/ET.pdf
Now, look at this:
through this structural/quantitative point of view 1*5 not= 1+1+1+1+1 not= 1*3+2 not= 1+4 and so on, because each arithmetical expression has a unique information form.
I did not find any mathematical branch that distinguishes between arithmetic operations according to their level of clarity, for example:
1*5 = *5 = {1,1,1,1,1}
1*3+2 = *3+2 = {{{1,1,1},1},1}
1*3;+2= *3;+2 = {{1,1,1},{{1},1}}
1*3;1*2= *3;*2 = {{1,1,1},{1,1}}
1+1+1+1+1 = +5 = {{{{1},1},1},1},1}
and so on ...
Shortly specking, any use of N to describe an information building-block, is at least some n AND addition or multiplication operations.
A proof that cannot be done by using standard N members.
Theorem: 1*5 not= 1+1+1+1+1
Proof: 1*5 = {1,1,1,1,1} not= {{{{1},1},1},1},1} = 1+1+1+1+1
Shortly specking, any use of N to describe an information building-block, is at least some n AND addition or multiplication operations.
If there was a way to choose the unique building blocks that we need for this goal, it was our gate to the universe of complexity exploration.
For this goal we need at least to properties:
1) A quick way to find any needed complex building block.
2) An ordered collection of unique complex building blocks.
Let us say that we want to construct a model of an information tree, where each building-block is a sub-tree that represents information clarity degree.
The result of this construction is a very complex model of finite or infinitely many ordered or unordered levels of information's clarity degrees upon finite or infinitely many different scales.
An example of (1) and (2):
http://www.geocities.com/complementarytheory/ETtable.pdf
An example a complex model can be found here:
http://www.geocities.com/complementarytheory/ComplexTree.pdf
Please be aware that the Natural numbers are used here as a private case of the clearest information tree, which is used here to find the exact x,y location of each unique building block, but it does not give us any information on the internal unique structure of this building block.
More than that, we cannot use the natural numbers to quantify the internal structure of any given buiding-block, which is based on uncertainy_AND_redundancy > 0, because the value of n>0 in this case, is a general representation of several random and different possibilities between 0 and k>=n.
Shortly speaking, our building-blocks locations can be found by N members, but their internal structure cannot described by them, because N members internal information structure, is based on 0 redundancy AND 0 uncertainty information form.
An example:
Let us take the trees that included in quantity 3:
{1,1,1} , {{1,1},1} , {{{1},1},1}
The first is a multiset and the last is a "normal" set.
For example let us say that there is a piano with 3 notes and we call it 3-system :
Code:
DO=D , RE=R , MI=M
The highest unclear information of 3-system is the most left information's-tree,
where each key has no unique value of its own, and vice versa.
<-Redundancy->
M M M ^<----Uncertainty
R R R | R R
D D D | D D M D R M
. . . v . . . . . .
| | | | | | | | |
3 = | | | |___|_ | |___| |
| | | | | | |
|___|___|_ |_______| |_______|
| | |
An example of 4-notes piano (DO=D , RE=R , MI=M , FA=F):
------------>>>
F F F F F F F F
M M M M M M M M
R R R R R R R R R R R R R R
D D D D D D D D D R D D D D D D
. . . . . . . . . . . . . . . .
| | | | | | | | | | | | | | | |
| | | | |__|_ | | |__| | | |__|_ |__|_
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
|__|__|__|_ |_____|__|_ |_____|__|_ |_____|____
| | | |
4 =
M M M
R R R R R R R
D R D D D R D R D D D F D D M F
. . . . . . . . . . . . . . . .
| | | | | | | | | | | | | | | |
|__| |__|_ |__| |__| | | | | |__|_ | |
| | | | | | | | | | |
| | | | |__|__|_ | |_____| |
| | | | | | | |
|_____|____ |_____|____ |________| |________|
| | | |
D R M F
. . . .
| | | |
|__| | |
| | |
|_____| |
| |
|________|
|
I like to look at the connection between redundancy_AND_uncertainty as "a cloud of possibilities", you know like the possibilities that we have in some Quantum element in the same space/time.
For example:
Let C be a closed door.
Let O be an opened door.
Let # be XOR.
Code:
C C
# #
O O
. .
| |
|___|_
|
O C
. .
| |
|___|
|
When we are using N members to describe information form which its redundany_AND_uncertainty levels are greater than 0, the best we can do is to use multiplication and addition as complementary operations, for example please look at page 7 (in the paper, not in the acrobat screen):
http://www.geocities.com/complementarytheory/ET.pdf
Now, look at this:
through this structural/quantitative point of view 1*5 not= 1+1+1+1+1 not= 1*3+2 not= 1+4 and so on, because each arithmetical expression has a unique information form.
I did not find any mathematical branch that distinguishes between arithmetic operations according to their level of clarity, for example:
1*5 = *5 = {1,1,1,1,1}
1*3+2 = *3+2 = {{{1,1,1},1},1}
1*3;+2= *3;+2 = {{1,1,1},{{1},1}}
1*3;1*2= *3;*2 = {{1,1,1},{1,1}}
1+1+1+1+1 = +5 = {{{{1},1},1},1},1}
and so on ...
Shortly specking, any use of N to describe an information building-block, is at least some n AND addition or multiplication operations.
Can you prove something about quantity that cannot be proven through usual mathematical methods?
A proof that cannot be done by using standard N members.
Theorem: 1*5 not= 1+1+1+1+1
Proof: 1*5 = {1,1,1,1,1} not= {{{{1},1},1},1},1} = 1+1+1+1+1
Shortly specking, any use of N to describe an information building-block, is at least some n AND addition or multiplication operations.
Last edited: